LSH Forest: Practical Algorithms Made Theoretical

DOI10.1137/1.9781611974782.5MaRDI QIDQ4575739zbMATH OpenOpenAlexFDO

Authors Alexandr Andoni, Ilya Razenshteyn, Negev Shekel Nosatzki

Publication date 16 July 2018

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

Full work available at URL https://doi.org/10.1137/1.9781611974782.5

Mathematics Subject Classification ID

Data structures (68P05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1759714
• Fast Algorithms for Computing Tree LCS
• Fast algorithms for computing tree LCS
• Algorithms for Forest Local Similarity
• Algorithms for local similarity between forests
• Approximation algorithms for nonbinary agreement forests
• An approximation algorithm for the \(l\)-pseudoforest deletion problem
• Algorithms and Computation

Cited in

(6)

• Index structures for fast similarity search for real-valued vectors. I
• ForestDSH: a universal hash design for discrete probability distributions
• Index structures for fast similarity search for symbol strings
• Graph-based time-space trade-offs for approximate near neighbors
• VBLSH: volume-balancing locality-sensitive hashing algorithm for K-nearest neighbors search
• Index structures for fast similarity search for binary vectors

This page was built for publication: LSH Forest: Practical Algorithms Made Theoretical

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