Pages that link to "Item:Q1891130"
From MaRDI portal
The following pages link to A simple randomized sieve algorithm for the closest-pair problem (Q1891130):
Displayed 18 items.
- Efficiently approximating color-spanning balls (Q284593) (← links)
- All-maximum and all-minimum problems under some measures (Q396657) (← links)
- Approximate \(k\)-closest-pairs in large high-dimensional data sets (Q814957) (← links)
- Polynomial-sized topological approximations using the permutahedron (Q1739197) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- Improved approximate Rips filtrations with shifted integer lattices and cubical complexes (Q2239807) (← links)
- A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
- On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q3122310) (← links)
- TIGHT QUANTUM BOUNDS FOR COMPUTATIONAL GEOMETRY PROBLEMS (Q3401879) (← links)
- ON ENUMERATING AND SELECTING DISTANCES (Q4682169) (← links)
- A unified approach to tail estimates for randomized incremental construction (Q5088886) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- (Q5092465) (← links)
- Improved Approximate Rips Filtrations with Shifted Integer Lattices (Q5111715) (← links)
- On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q5115796) (← links)
- (Q5121902) (← links)
- (Q5140838) (← links)
- Efficient randomized incremental algorithm for the closest pair problem using Leafary trees (Q6064016) (← links)