Locality-sensitive Hashing without False Negatives

DOI10.1137/1.9781611974331.ch1zbMath1410.68103arXiv1507.03225OpenAlexW2951895957MaRDI QIDQ4575575

Rasmus Pagh

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.03225

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (6)

I/O-efficient similarity join ⋮ Covering codes for the fixed length Levenshtein metric ⋮ Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time ⋮ Index structures for fast similarity search for binary vectors ⋮ Locality-Sensitive Hashing Without False Negatives for $$l_p$$ ⋮ Frequent-Itemset Mining Using Locality-Sensitive Hashing

This page was built for publication: Locality-sensitive Hashing without False Negatives