Data-dependent hashing via nonlinear spectral gaps
From MaRDI portal
Recommendations
Cited in
(12)- Multidimensional quantile hashing is very efficient for nonuniform distributions
- ForestDSH: a universal hash design for discrete probability distributions
- An average John theorem
- Fast spectral analysis for approximate nearest neighbor search
- Nonpositive curvature is not coarsely universal
- Optimal data-dependent hashing for approximate near neighbors
- Tight lower bounds for data-dependent locality-sensitive hashing
- Uncorrelated Component Analysis-Based Hashing
- Approximate near neighbors for general symmetric norms
- VBLSH: volume-balancing locality-sensitive hashing algorithm for K-nearest neighbors search
- Near neighbor search via efficient average distortion embeddings
- Lipschitz decompositions of finite _p metrics
This page was built for publication: Data-dependent hashing via nonlinear spectral gaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230338)