An optimal randomised cell probe lower bound for approximate nearest neighbour searching

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 473-482

  Chakrabarti, Amit ^a   Regev, Oded ^b  

^a Dartmouth Department of Computer Science_Dartmouth College   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; ONLINE SEARCHING; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES;

CELL PROBES; LOWER BOUNDS; MESSAGE COMPRESSION; NEIGHBOR SEARCHING;

APPROXIMATION THEORY;

EID: 17744369733     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. In Proc. 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 209-218, 2002.
2. O. Barkol and Y. Rabani. Tighter lower bounds for nearest neighbor search and related problems in the cell probe model. In Proc. 32nd Annual ACM Symposium on the Theory of Computing, pages 388-396, 2000.
3. P. Beame and V. Guruswami. Private communication. 2003.
4. A. Borodin, R. Ostrovsky, and Y. Rabani. Lower bounds for high dimensional nearest neighbor search and related problems. In Proc. 31st Annual ACM Symposium on the Theory of Computing, pages 312-321, 1999.
5. A. Chakrabarti, B. Chazelle, B. Gum, and A. Lvov. A lower bound on the complexity of approximate nearest-neighbor searching on the hamming cube. In Proc. 31st Annual ACM Symposium on the Theory of Computing, pages 305-311, 1999.
6. A. Chakrabarti, Y. Shi, A. Wirth, and A. C. Yao. Informational complexity and the direct sum problem for simultaneous message complexity. In Proc. 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 270-278, 2001.
7. T. M. Cover and P. E. Hart. Nearest neighbor pattern classification. IEEE Trans. Inf. Theory, 13(1):21-27, 1967.
8. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Heidelberg, 2000.
9. S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman. Indexing by latent semantic analysis. J. Amer. Soc. Inf. Sci., 41(6):391-407, 1990.
10. R. O. Duda and P. E. Hart. Pattern classification and scene analysis. John Wiley, New York, NY, 1973.
11. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. J. ACM, 31(3):538-544, 1984. Preliminary version in Proc. 23rd Annu. IEEE Symp. Found. Comp. Sci., pages 165-169.
12. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. J. ACM, 31(3):538-544, 1984. Preliminary version in Proc. 23rd Annu. IEEE Symp. Found. Comp. Sci., pages 165-169.
13. S. Har-Peled. A replacement for Voronoi diagrams of near linear size. In Proc. 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 94-103, 2001.
14. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. 30th Annual ACM Symposium on the Theory of Computing, pages 604-613, 1998.
15. R. Jain, J. Radhakrishnan, and P. Sen. A direct sum theorem in communication complexity via message compression. In Proc. 30th International Colloquium on Automata, Languages and Programming, pages 300-315, 2003.
16. T. S. Jayram, S. Khot, R. Kumar, and Y. Rabani. Cell-probe lower bounds for the partial match problem. In Proc. 35th Annual ACM Symposium on the Theory of Computing, pages 667-672, 2003.
17. H. Klauck, A. Nayak, A. Ta-Shma, and D. Zuckerman. Interaction in quantum communication and the complexity of set disjointness. In Proc. 33rd Annual ACM Symposium on the Theory of Computing, pages 124-133, 2001.
18. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high-dimensional spaces. SIAM J. Comput., 30(2):457-474, 2000. Preliminary version in Proc. 30th Annu. ACM Symp. Theory Comput., pages 614-623, 1998.
19. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high-dimensional spaces. SIAM J. Comput., 30(2):457-474, 2000. Preliminary version in Proc. 30th Annu. ACM Symp. Theory Comput., pages 614-623, 1998.
20. D. Liu. A strong lower bound for approximate nearest neighbor searching in the cell probe model. Manuscript, 2003.
21. P. B. Miltersen. Lower bounds for union-split-find related problems on random access machines. In Proc. 26th Annual ACM Symposium on the Theory of Computing, pages 625-634, 1994.
22. P. B. Miltersen, N. Nisan, S. Safra, and A. Wigderson. On data structures and asymmetric communication complexity. J. Comput. Syst. Sci., 57(1):37-49, 1998. Preliminary version in Proc. 27th Annu. ACM Symp. Theory Comput., pages 103-111, 1995.
23. P. B. Miltersen, N. Nisan, S. Safra, and A. Wigderson. On data structures and asymmetric communication complexity. J. Comput. Syst. Sci., 57(1):37-49, 1998. Preliminary version in Proc. 27th Annu. ACM Symp. Theory Comput., pages 103-111, 1995.
24. A. A. Salamov and V. V. Solovyev. Prediction of protein secondary structure by combining nearest-neighbor algorithms and multiple sequence alignments. J. Mol. Biol., 247(1):11-15, 1995.
25. G. Salton and M. J. McGill. Introduction to Modern Information Retrieval. McGraw-Hill, New York, NY, 1983.
26. P. Sen. Lower bounds for predecessor searching in the cell probe model. In Proc. 18th Annual IEEE Conference on Computational Complexity, pages 73-83, 2003.
27. A. C. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. 18th Annual IEEE Symposium on Foundations of Computer Science, pages 222-227, 1977.
28. A. C. Yao. Should tables be sorted? J. ACM, 28(3):615-628, 1981.
29. T. M. Yi and E. S. Lander. Protein secondary structure prediction using nearest-neighbor methods. J. Mol. Biol., 232(4):1117-1129, 1993.