LSH Algorithm and Implementation (E2LSH)

Locality-Sensitive Hashing (LSH) is an algorithm for solving the (approximate/exact) Near Neighbor Search in high dimensional spaces. On this webpage, you will find pointers to the newest LSH algorithm in Euclidean (l_2) spaces, as well as the description of the E2LSH package, an implementation of this new algorithm for the Euclidean space.

This research is supported by NSF CAREER Grant #0133849 "Approximate Algorithms for High-dimensional Geometric Problems".