Range searching on uncertain data

DOI10.1145/2344422.2344433zbMath1295.68098OpenAlexW2072729927MaRDI QIDQ3189086

Ke Yi, Siu-Wing Cheng, Pankaj K. Agarwal

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2344422.2344433

zbMATH Keywords

data structuresuncertain datarange searching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Searching and sorting (68P10) Data structures (68P05)

Related Items (11)

On the separability of stochastic geometric objects, with applications ⋮ On the arrangement of stochastic lines in \(\mathbb{R}^2\) ⋮ Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points ⋮ Answering skyline queries on probabilistic data using the dominance of probabilistic skyline tuples ⋮ Convex hulls under uncertainty ⋮ Nearest-neighbor searching under uncertainty. I ⋮ On the Most Likely Voronoi Diagram and Nearest Neighbor Searching ⋮ Range-max queries on uncertain data ⋮ On the expected diameter, width, and complexity of a stochastic convex hull ⋮ Expected computations on color spanning sets ⋮ Sublinear-time reductions for big data computing

This page was built for publication: Range searching on uncertain data