Pages that link to "Item:Q2943898"
From MaRDI portal
The following pages link to Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) (Q2943898):
Displayed 16 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)
- GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions (Q2023176) (← 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)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
- Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
- On the Distortion of Locality Sensitive Hashing (Q4634022) (← links)
- (Q4638108) (← links)
- Lattice-based locality sensitive hashing is optimal (Q4993309) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- (Q5111221) (← links)
- Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}. (Q5136284) (← links)
- Local Density Estimation in High Dimensions (Q5870349) (← links)
- Nearly optimal property preserving hashing (Q6108992) (← links)