Lower bounds for high dimensional nearest neighbor search and related problems
- 1 May 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 312-321
- https://doi.org/10.1145/301250.301330
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- Query by image and video content: the QBIC systemComputer, 1995
- On the cell probe complexity of polynomial evaluationTheoretical Computer Science, 1995
- Point Location in Arrangements of HyperplanesInformation and Computation, 1993
- Approximate closest-point queries in high dimensionsInformation Processing Letters, 1993
- A Randomized Algorithm for Closest-Point QueriesSIAM Journal on Computing, 1988
- The complexity of partial match retrieval in a dynamic settingJournal of Algorithms, 1982
- A Lower Bound on the Complexity of Orthogonal Range QueriesJournal of the ACM, 1981
- Should Tables Be Sorted?Journal of the ACM, 1981
- Multidimensional Searching ProblemsSIAM Journal on Computing, 1976
- Partial-Match Retrieval AlgorithmsSIAM Journal on Computing, 1976