Approximate range searching in higher dimension
From MaRDI portal
Publication:2456663
DOI10.1016/J.COMGEO.2007.05.008zbMATH Open1124.65018OpenAlexW2115964316MaRDI QIDQ2456663FDOQ2456663
Authors: Bernard Chazelle, Ding Liu, Avner Magen 
Publication date: 19 October 2007
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.05.008
Recommendations
Cites Work
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On range searching with semialgebraic sets
- How hard is half-space range searching?
- Title not available (Why is that?)
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- Approximate range searching
Cited In (11)
- Efficient range searching for categorical and plain data
- The effect of corners on the complexity of approximate range searching
- On the difficulty of range searching.
- Quasi-optimal range searching in spaces of finite VC-dimension
- Approximate range searching: The absolute model
- Approximate range queries for clustering
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Approximate nearest neighbors search without false negatives for \(l_2\) for \(c>\sqrt{\log\log n}\)
- Approximate range searching
- Simplex Range Searching and Its Variants: A Review
- Approximate Range Searching: The Absolute Model
This page was built for publication: Approximate range searching in higher dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456663)
