Short Explanation
- Lsh: L hash tables
- Hypercube: a hypercube structure maps each vector with a vertice
- L: Number of hash tables
- K: Number of hash functions
- W: Window size for euclidean metric. This value should be close to the real nearest neighbor.
- Coefficient: Defines the table size of each hash table. Table size = n(number of data points) x coefficient(< 1)
Ioannis z. Emiris Professor @ Department of Informatics & Telecommunications
National and Kapodistrian University of Athens that let me to use his slides
Webpage: http://cgi.di.uoa.gr/~emiris/index-eng.html