Beyond locality-sensitive hashing
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
MetadataShow full item record
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).
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.32Cataloged from student-submitted PDF version of thesis.Includes bibliographical references (pages 43-45).
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology
Electrical Engineering and Computer Science.