Login / Signup
A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube.
Amit Chakrabarti
Bernard Chazelle
Benjamin Gum
Alexey Lvov
Published in:
STOC (1999)
Keyphrases
</>
nearest neighbor searching
lower bound
upper bound
range searching
computational geometry
point sets
optimal solution
objective function
computational complexity
related problems
nearest neighbor
multi dimensional
motion planning