Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model
- 1 June 2002
- journal article
- conference paper
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 64 (4) , 873-896
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A non-linear time lower bound for Boolean branching programs2003
- Fuzzy queries in multimedia database systems1998
- Query by image and video content: the QBIC systemComputer, 1995
- Point Location in Arrangements of HyperplanesInformation and Computation, 1993
- A weighted nearest neighbor algorithm for learning with symbolic featuresMachine Learning, 1993
- Indexing by latent semantic analysisJournal of the American Society for Information Science, 1990
- A Randomized Algorithm for Closest-Point QueriesSIAM Journal on Computing, 1988
- 8 Nearest neighbor methods in discrimination1982
- Should Tables Be Sorted?Journal of the ACM, 1981
- Multidimensional Searching ProblemsSIAM Journal on Computing, 1976