Beyond locality-sensitive hashing

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2014, Pages 1018-1028

  Andon, Alexandr ^a   Indyk, Piotr ^b   Nguyên, Huy L ^c   Razenshteyn, Ilya ^b  

^a MICROSOFT RESEARCH   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Princeton ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

EUCLIDEAN SPACES; HAMMING SPACE; LOCALITY SENSITIVE HASHING; LOWER BOUNDS; QUERY TIME;

DATA STRUCTURES;

EID: 84902096384     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973402.76     Document Type: Conference Paper

References (24)

1. Frontiers in Massive Data Analysis. The National Academies Press, 2013.
2. Alexandr Andoni. Nearest Neighbor Search: The Old, the New, and the Impossible. PhD thesis, Massachusetts Institute of Technology, 2009.
3. Alexandr Andoni and Piotr Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS '2006), pages 459-468, 2006.
4. Andrei Z. Broder. Filtering near-duplicate documents. Proceedings of the 1st International Conference on Fun with Algorithms (FUN '1998), 1998.
5. Andrea Califano and Isidore Rigoutsos. FLASH: A fast look-up algorithm for string homology. In Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology (ISMB '1993), pages 56-64, 1993.
6. Kenneth L. Clarkson. A randomized algorithm for closest-point queries. SIAM Journal on Computing, 17(4):830-847, 1988.
7. Sanjoy Dasgupta and Anupam Gupta. An elementary proof of a theorem of Johnson and Lindenstrauss. Random Structures and Algorithms, 22(1):60-65, 2003.
8. Moshe Dubiner. Bucketing coding and information theory for the statistical highdimensional nearest- neighbor problem. IEEE Transactions on Information Theory, 56(8):4166-4179, 2010.
9. Daniel H. Greene, Michal Parnas, and F. Frances Yao. Multi-index hashing for information retrieval. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS '1994), pages 722-731, 1994.
10. Martin Grotschel, Laszlo Lovasz, and Alexander Schrijver. Geometric algorithms and combinatorial optimization. Springer-Verlag, 1988.
11. Sariel Har-Peled, Piotr Indyk, and Rajeev Motwani. Approximate nearest neighbor: Towards removing the curse of dimensionality. Theory of Computing, 8(1):321-350, 2012.
12. Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the 30th ACM Symposium on the Theory of Computing (STOC '1998), pages 604- 613, 1998.
13. William B. Johnson and Joram Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference in modern analysis and probability (New Haven, Connecticut, 1982), volume 26 of Contemporary Mathematics, pages 189-206. 1984.
14. David R. Karger, Rajeev Motwani, and Madhu Sudan. Approximate graph coloring by semidefinite programming. Journal of the ACM, 45(2):246-265, 1998.
15. Richard M. Karp, Orli Waarts, and Geoffrey Zweig. The bit vector intersection problem (preliminary version). In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS '1995), pages 621-630, 1995.
16. Nathan Linial, Eran London, and Yuri Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
17. Jin Matousek. Lectures on Discrete Geometry. Springer, 2002.
18. Stefan Meiser. Point location in arrangements of hyperplanes. Information and Computation, 106(2) :286- 303, 1993.
19. Rajeev Motwani, Rina Panigrahy, and Assaf Naor. Lower bounds on locality sensitive hashing. SIAM Journal on Discrete Mathematics, 21(4):930-935, 2007.
20. Ryan O'Donnell, Yi Wu, and Yuan Zhou. Optimal lower bounds for locality sensitive hashing (except when q is tiny). In Proceedings of Innovations in Computer Science (ICS '2011), pages 275-283, 2011.
21. Rina Panigrahy, Kunal Talwar, and Udi Wieder. A geometric approach to lower bounds for approximate near-neighbor search and partial match. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS '2008), pages 414-423, 2008.
22. Rina Panigrahy, Kunal Talwar, and Udi Wieder. Lower bounds on near neighbor search via metric expansion. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS '2010), pages 805-814, 2010.
23. Ramamohan Paturi, Sanguthevar Rajasekaran, and John H. Reif. The light bulb problem. Information and Computation, 117(2):187-192, 1995.
24. Gregory Valiant. Finding correlations in subquadratic time, with applications to learning parities and juntas. In Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS '2012), pages 11-20, 2012.