Cite
HARVARD Citation
Khedr, A. (2016). Decomposable algorithm for computing k-nearest neighbours across partitioned data. International journal of parallel, emergent and distributed systems. 31 (4), pp. 334-353. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Khedr, A. (2016). Decomposable algorithm for computing k-nearest neighbours across partitioned data. International journal of parallel, emergent and distributed systems. 31 (4), pp. 334-353. [Online].