Range searching on uncertain data
From MaRDI portal
Recommendations
Cited in
(13)- Efficient range searching for categorical and plain data
- On the separability of stochastic geometric objects, with applications
- Range-max queries on uncertain data
- Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
- Expected computations on color spanning sets
- Nearest-neighbor searching under uncertainty. I
- Range counting coresets for uncertain data
- On the arrangement of stochastic lines in \(\mathbb{R}^2\)
- On the Most Likely Voronoi Diagram and Nearest Neighbor Searching
- Processing probabilistic range queries over Gaussian-based uncertain data
- Answering skyline queries on probabilistic data using the dominance of probabilistic skyline tuples
- Uncertain probabilistic range queries on multidimensional data
- Sublinear-time reductions for big data computing
This page was built for publication: Range searching on uncertain data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189086)