Nearest-Neighbor Searching Under Uncertainty II

DOI10.1145/2955098zbMath1445.68076arXiv1606.00112OpenAlexW2531454488WikidataQ114977314 ScholiaQ114977314MaRDI QIDQ4962637

Ke Yi, Jeff M. Phillips, Wuzhou Zhang, Sariel Har-Peled, Boris Aronov, Pankaj K. Agarwal

Publication date: 5 November 2018

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

Full work available at URL: https://arxiv.org/abs/1606.00112

zbMATH Keywords

approximate nearest neighborthreshold queriesindexing uncertain dataprobabilistic nearest neighbor

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (15)

On the separability of stochastic geometric objects, with applications ⋮ Querying with Uncertainty ⋮ From proximity to utility: a Voronoi partition of Pareto optima ⋮ Sliding-window probabilistic threshold aggregate queries on uncertain data streams ⋮ Convex hulls under uncertainty ⋮ Nearest-neighbor searching under uncertainty. I ⋮ Fréchet Distance for Uncertain Curves ⋮ Fast neighbor search by using revised \(k\)-d tree ⋮ On the Most Likely Voronoi Diagram and Nearest Neighbor Searching ⋮ Updating Dynamic Random Hyperbolic Graphs in Sublinear Time ⋮ Range-max queries on uncertain data ⋮ Unnamed Item ⋮ Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently ⋮ On Top-k Weighted<scp>Sum</scp>Aggregate Nearest and Farthest Neighbors in the L1 Plane ⋮ Approximating Minimization Diagrams and Generalized Proximity Search

This page was built for publication: Nearest-Neighbor Searching Under Uncertainty II