The following pages link to Approximate range searching (Q1595401):
Displaying 39 items.
- Data structures for range-aggregate extent queries (Q390147) (← links)
- Approximate range searching in external memory (Q627532) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- Energy-efficient paths in radio networks (Q639290) (← links)
- Constructing minimum-interference networks (Q929744) (← links)
- Reporting flock patterns (Q945937) (← links)
- Efficient \(c\)-oriented range searching with DOP-trees (Q1000927) (← links)
- The effect of corners on the complexity of approximate range searching (Q1014333) (← links)
- Range searching in low-density environments (Q1350104) (← links)
- Robust proximity search for balls using sublinear space (Q1702130) (← links)
- Go with the flow, on Jupiter and snow. Coherence from model-free video data without trajectories (Q2022735) (← links)
- Kernel-independent adaptive construction of \(\mathcal{H}^2\)-matrix approximations (Q2068355) (← links)
- Approximate range closest-pair queries (Q2206740) (← links)
- Range search on tuples of points (Q2253898) (← links)
- Approximate range searching: The absolute model (Q2269144) (← links)
- The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching (Q2287830) (← links)
- Approximate range searching in higher dimension (Q2456663) (← links)
- On the difficulty of range searching. (Q2482904) (← links)
- Approximate range searching using binary space partitions (Q2489539) (← links)
- Range searching in multidimensional databases using navigation metadata (Q2656721) (← links)
- Space-time tradeoffs for approximate spherical range counting (Q2921710) (← links)
- Efficient range searching for categorical and plain data (Q2943571) (← links)
- Range searching on uncertain data (Q3189086) (← links)
- SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS (Q3521595) (← links)
- Approximate Range Searching: The Absolute Model (Q3603509) (← links)
- Tight Space Bounds for Two-Dimensional Approximate Range Counting (Q4554350) (← links)
- Approximate Polytope Membership Queries (Q4600697) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- Topology B-trees and their applications (Q5057450) (← links)
- (Q5111687) (← links)
- (Q5136262) (← links)
- POINT SET DISTANCE AND ORTHOGONAL RANGE PROBLEMS WITH DEPENDENT GEOMETRIC UNCERTAINTIES (Q5300009) (← links)
- I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions (Q5387782) (← links)
- Approximate Range Searching in External Memory (Q5387785) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465845) (← links)
- GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING (Q5696538) (← links)
- STACS 2005 (Q5710691) (← links)
- On approximate range counting and depth (Q5902137) (← links)
- Half-plane point retrieval queries with independent and dependent geometric uncertainties (Q6110075) (← links)
