Beyond locality-sensitive hashing

Author(s)
Razenshteyn, Ilya
Thumbnail
DownloadFull printable version (502.5Kb)
Other Contributors
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Advisor
Piotr Indyk.
Terms of use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
We present a new data structure for the c-approximate near neighbor problem (ANN) in the Euclidean space ... This is the first improvement over the result by Andoni and Indyk (FOCS 2006) and the first data structure that bypasses a locality-sensitive hashing lower bound proved by O'Donnell, Wu and Zhou (ICS 2011). By known reductions we obtain a data structure for the Hamming space and ... which is the first improvement over the result of Indyk and Motwani (STOC 1998).
Description
Thesis: S.M. in Computer Science and Engineering, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
 
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
 
32
 
Cataloged from student-submitted PDF version of thesis.
 
Includes bibliographical references (pages 43-45).
 
Date issued
2014
URI
http://hdl.handle.net/1721.1/89862
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.
Collections