Range counting oracles for geometric problems
From MaRDI portal
Cites work
- 1-pass relative-error L_p-sampling with applications
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size
- Active-learning a convex body in low dimensions
- Approximate geometric MST range queries
- Approximate range queries for clustering
- Approximate range searching
- Approximating the Minimum Spanning Tree Weight in Sublinear Time
- Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
- Computational Complexity
- Computational geometry. Algorithms and applications.
- Deterministic, near-linear 𝜀 -approximation algorithm for geometric bipartite matching
- Efficient algorithms for geometric partial matching
- Efficient Sketches for Earth-Mover Distance, with Applications
- Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
- Estimating the weight of metric minimum spanning trees in sublinear-time
- Facility location in the sublinear geometric model
- Geometric approximation algorithms
- scientific article; zbMATH DE number 1875421 (Why is no real title available?)
- scientific article; zbMATH DE number 7788453 (Why is no real title available?)
- On approximating the number of k-cliques in sublinear time
- Orthogonal Range Reporting in Three and Higher Dimensions
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
- Range-clustering queries
- Sampling in dynamic data streams and applications
- Streaming Euclidean MST to a constant factor
- Sublinear algorithms for gap edit distance
- Sublinear geometric algorithms
- Sublinear time algorithms
- Sublinear time algorithms and complexity of approximate maximum matching
- Sublinear time algorithms for earth mover's distance
- Sublinear-time Algorithms
- Sublinear-time algorithms for computing \& embedding gap edit distance
- The sparse awakens: streaming algorithms for matching size estimation in sparse graphs
- Wasserstein discriminant analysis
This page was built for publication: Range counting oracles for geometric problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312688)
