1. Fast k-selection algorithms for graphics processing units;Alabi Tolu;Journal of Experimental Algorithmics (JEA),2012
2. ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms
3. Artem Babenko and Victor S. Lempitsky . 2016 . Efficient Indexing of Billion-Scale Datasets of Deep Descriptors. In 2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016 , Las Vegas, NV, USA, June 27--30 , 2016 . IEEE Computer Society, Las Vegas, 2055--2063. Artem Babenko and Victor S. Lempitsky. 2016. Efficient Indexing of Billion-Scale Datasets of Deep Descriptors. In 2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, NV, USA, June 27--30, 2016. IEEE Computer Society, Las Vegas, 2055--2063.
4. Ricardo Barrientos , J.I. Gomez , Christian Tenllado , and Manuel Prieto Matias . 2010. Heap based k-nearest neighbor search on GPUs. Congreso Espanol de Informática (CEDI) 1, 7 (01 2010 ), 559--566. Ricardo Barrientos, J.I. Gomez, Christian Tenllado, and Manuel Prieto Matias. 2010. Heap based k-nearest neighbor search on GPUs. Congreso Espanol de Informática (CEDI) 1, 7 (01 2010), 559--566.
5. GPU-based exhaustive algorithms processing kNN queries