CoveringLSH: locality-sensitive hashing without false negatives

DOI10.1145/3155300MaRDI QIDQ4554357zbMATH OpenOpenAlexWikidataFDO

Authors Rasmus Pagh

Publication date 13 November 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3155300

zbMATH Keywords

high-dimensionallocality-sensitive hashingrecallsimilarity search

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Locality-sensitive hashing without false negatives
• Locality-Sensitive Hashing Without False Negatives for l_p
• Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
• Lower Bounds on Locality Sensitive Hashing
• Why locality sensitive hashing works: a practical perspective

Cited in

(4)

• Why locality sensitive hashing works: a practical perspective
• Locality-Sensitive Hashing Without False Negatives for l_p
• Locality-sensitive hashing without false negatives
• Locality-sensitive bucketing functions for the edit distance

This page was built for publication: CoveringLSH: locality-sensitive hashing without false negatives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554357)