Neighborhood preserving hashing and approximate queries

Authors:
Danny Dolev;Yuval Harari;Nathan Linial;Noam Nisan;Michal Parnas
Affiliations:
Institute of Computer Science, Hebrew University, Jeruslem;Institute of Computer Science, Hebrew University, Jeruslem;Institute of Computer Science, Hebrew University, Jeruslem;Institute of Computer Science, Hebrew University, Jeruslem;Institute of Computer Science, Hebrew University, Jeruslem
Venue:
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Year:
1994

Non-expansive hashing

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximate nearest neighbors: towards removing the curse of dimensionality

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Lower bounds for high dimensional nearest neighbor search and related problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Dictionary Look-Up within Small Edit Distance

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Detecting near-duplicates for web crawling

Proceedings of the 16th international conference on World Wide Web
Optimal hash functions for approximate matches on the n-cube

IEEE Transactions on Information Theory
Efficient approximate dictionary look-up for long words over small alphabets

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Hi-index	0.06