Searching for "Non-Expansive Hashing." – sorted by Relevance.
-
Non-Expansive Hashing
- Non-Expansive Hashing Nathan Linial Ori Sasson y Abstract In a non-expansive hashing scheme
- Cited by 22 (0 self) – Add To MetaCart
-
Locality-Preserving Hashing in Multidimensional Spaces
- ourselves to polynomial sized families of natural subclass of non-expansive hash functions. We show
- Cited by 38 (2 self) – Add To MetaCart
-
Simple Algorithms for Hot-Potato Routing
- and Sasson [20] present a hashing scheme which is non-expansive - close inputs are stored close to each other
- Add To MetaCart
-
Further Experimentations On The Scalability Of The GEMGA
- -wise similarity computation, where m is the population size. Non-expansive hash functions [14, 9] can be used
- Cited by 5 (3 self) – Add To MetaCart
-
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- that map "close" elements to "close" images. In particular, non-expansive hash functions guarantee
- Cited by 143 (9 self) – Add To MetaCart
-
Locality preserving dictionaries: Theory and application to clustering in databases
- to pipeline the query execution. 1.2 Related Work There is some recent work on non-expansive hashing, both
- Cited by 6 (0 self) – Add To MetaCart

