Abstract
We present a GPU algorithm for the nearest neighbor search, an important database problem. The search is completely performed using the GPU: No further post-processing using the CPU is needed. Our experimental results, using large synthetic and real-world data sets, showed that our GPU algorithm is several times faster than its CPU version. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Bustos, B., Deussen, O., Hiller, S., & Keim, D. (2006). A graphics hardware accelerated algorithm for nearest neighbor search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3994 LNCS-IV, pp. 196–199). Springer Verlag. https://doi.org/10.1007/11758549_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
