Near Neighbor Search in High Dimensions via Locality Sensitive Hashing

Piotr Indyk
Massachusetts Institute of Technology

Locality-Sensitive Hashing, introduced by Indyk-Motwani in 1998, is a randomized technique for solving near neighbor search problems in high dimensions. In this talk I am going to describe recent developments to this technique.

Back to MGA Workshop II: Multiscale Geometry in Scientific Computing