Pages that link to "Item:Q2411831"
From MaRDI portal
The following pages link to Nearest-neighbor searching under uncertainty. I (Q2411831):
Displaying 14 items.
- Computing the center of uncertain points on tree networks (Q527423) (← links)
- Range-max queries on uncertain data (Q1745722) (← links)
- Expected computations on color spanning sets (Q2343982) (← links)
- Convex hulls under uncertainty (Q2408916) (← links)
- On the Most Likely Voronoi Diagram and Nearest Neighbor Searching (Q2988722) (← links)
- Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points (Q3448848) (← links)
- Computing the Center of Uncertain Points on Tree Networks (Q3449857) (← links)
- (Q4778562) (← links)
- r-Gatherings on a star and uncertain r-gatherings on a line (Q5101887) (← links)
- Approximating the distribution of the median and other robust estimators on uncertain data (Q5115783) (← links)
- On Top-k Weighted<scp>Sum</scp>Aggregate Nearest and Farthest Neighbors in the L1 Plane (Q5241377) (← links)
- Approximating Minimization Diagrams and Generalized Proximity Search (Q5502175) (← links)
- Optimal nearest neighbor queries in sensor networks (Q5899559) (← links)
- Covering uncertain points in a tree (Q5920112) (← links)
