Pages that link to "Item:Q3544242"
From MaRDI portal
The following pages link to Lower Bounds on Locality Sensitive Hashing (Q3544242):
Displaying 12 items.
- Why locality sensitive hashing works: a practical perspective (Q1751421) (← 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)
- Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) (Q2943898) (← links)
- Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
- On the Distortion of Locality Sensitive Hashing (Q4634022) (← 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)
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees (Q5458545) (← links)
- Nearly optimal property preserving hashing (Q6108992) (← links)
