LSH Algorithm and Implementation (E2LSH). Locality-Sensitive Hashing (LSH) is an algorithm for solving the approximate or exact Near Neighbor Search in high dimensional spaces. This webpage links to the newest LSH algorithms in Euclidean and Hamming spaces, as well as the E2LSH package, an implementation of an early practical LSH algorithm.

References in zbMATH (referenced in 3 articles )

Showing results 1 to 3 of 3.
Sorted by year (citations)

  1. Aumüller, Martin; Christiani, Tobias; Pagh, Rasmus; Vesterli, Michael: PUFFINN: parameterless and universally fast finding of nearest neighbors (2019)
  2. Xiao, Bo; Biros, George: Parallel algorithms for nearest neighbor search problems in high dimensions (2016)
  3. Yin, Dongsheng; Liu, Debo: Content-based image retrial based on Hadoop (2013) ioport