Lower bounds on near neighbor search via metric expansion

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

Volumn , Issue , 2010, Pages 805-814

  Panigrahy, Rina ^a   Talwar, Kunal ^a   Wieder, Udi ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPANSION; GRAPH ALGORITHMS; GRAPH STRUCTURES; PROBES; SET THEORY; TOPOLOGY;

APPROXIMATE ALGORITHMS; COMMUNICATION COMPLEXITY; LOWER BOUNDS; METRIC SPACES; NEAR NEIGHBOR SEARCHES; NEAREST NEIGHBORS; RANDOMIZED ALGORITHMS; TIME SPACE TRADEOFFS;

NEAREST NEIGHBOR SEARCH;

EID: 78751515810     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.82     Document Type: Conference Paper

References (20)

1. A. Andoni, D. Croitoru, and M. Patrascu. Hardness of nearest neighbor under L-infinity. In FOCS, pages 424-433, 2008.
2. A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM, 51(1):117-122, 2008.
3. A. Andoni, P. Indyk, and M. Patrascu. On the optimality of the dimensionality reduction method. In FOCS, pages 449-458, Washington, DC, USA, 2006. IEEE Computer Society.
4. O. Barkol and Y. Rabani. Tighter lower bounds for nearest neighbor search and related problems in the cell probe model. J. Comput. Syst. Sci., 64(4):873-896, 2002.
5. P. Beame and E. Vee. Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. In STOC, pages 688-697, New York, NY, USA, 2002. ACM.
6. B. Bollobas. Combinatorics. Cambridge University Press, 1986.
7. A. Borodin, R. Ostrovsky, and Y. Rabani. Lower bounds for high dimensional nearest neighbor search and related problems. In STOC, pages 312-321, New York, NY, USA, 1999. ACM.
8. 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 STOC, pages 305-311, New York, NY, USA, 1999. ACM.
9. A. Chakrabarti and O. Regev. An optimal randomised cell probe lower bound for approximate nearest neighbour searching. In FOCS, pages 473-482, 2004.
10. 1 norm. J. Comput. Syst. Sci, 63(4):627-638, 2001.
11. P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In STOC, pages 604-613, 1998.
12. R. Krauthgamer and J. R. Lee. The black-box complexity of nearest-neighbor search. Theor. Comput. Sci., 348(2-3):262-276, 2005.
13. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. In STOC, pages 614-623, New York, NY, USA, 1998. ACM.
14. D. Liu. A strong lower bound for approximate nearest neighbor searching. Inf. Process. Lett., 92(1):23-29, 2004.
15. 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.
16. R. Motwani, A. Naor, and R. Panigrahy. Lower bounds on locality sensitive hashing. In SCG, pages 154-157, New York, NY, USA, 2006. ACM.
17. R. O'Donnell, Y. Wu, and Y. Zhou. Optimal lower bounds for locality sensitive hashing (except when q is tiny). Manuscript, 2009.
18. R. Panigrahy, K. Talwar, and U. Wieder. A geometric approach to lower bounds for approximate near-neighbor search and partial match. In FOCS, pages 414-423, 2008.
19. R. Panigrahy, K. Talwar, and U. Wieder. Lower Bounds on Near Neighbor Search via Metric Expansion. arXiv:1005.0418v1 [cs.DS], 2010.
20. M. Pǎtraşcu and M. Thorup. Higher lower bounds for near-neighbor and further rich problems. In FOCS, pages 646-654, 2006.