Parallel search of k-nearest neighbors with synchronous operations

55 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Billion-Scale Similarity Search with GPUs (2017, methodology): “There are many implementations of similarity search on GPUs, but mostly with binary codes [36], small datasets [44], or exhaustive search [14, 40, 41].”
Efficient Selection Algorithm for Fast k-NN Search on GPUs (2015, methodology): “They can beat TBS by 2.37× to 7.5× while beat QMS up to 4.2× when k is small.”
Efficient Computation of k-Nearest Neighbour Graphs for Large High-Dimensional Data Sets on GPU Clusters (2013, methodology): “In another implementation of a brute force k-NN search algorithm, [33] proposed the truncated bitonic sort (TBiS), a selection method based on the Biotonic sort.”