151
Voted
WEA
2010
Springer
15 years 10 months ago
2010
Springer
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...