Pages that link to "Item:Q4575737"
From MaRDI portal
The following pages link to Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors (Q4575737):
Displaying 12 items.
- Index structures for fast similarity search for binary vectors (Q681740) (← links)
- Index structures for fast similarity search for real-valued vectors. I (Q1745711) (← links)
- ForestDSH: a universal hash design for discrete probability distributions (Q2036729) (← links)
- Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\) (Q2110372) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time (Q2205636) (← links)
- A kd-tree-accelerated hybrid data-driven/model-based approach for poroelasticity problems with multi-fidelity multi-physics data (Q2237269) (← links)
- A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
- On the Distortion of Locality Sensitive Hashing (Q4634022) (← links)
- (Q5115805) (← links)
- Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of L1 (Q5875504) (← links)
- A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (Q5919060) (← links)
