Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
The upper envelope of Voronoi surfaces and its applications
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Randomized algorithms
Algorithms for generalized halfspace range searching and other intersection searching problems
Computational Geometry: Theory and Applications
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
SIAM Journal on Computing
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
SIAM Journal on Computing
Improved bounds on the sample complexity of learning
Journal of Computer and System Sciences
Querying Imprecise Data in Moving Object Environments
IEEE Transactions on Knowledge and Data Engineering
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Optimal halfspace range reporting in three dimensions
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Managing and Mining Uncertain Data
Managing and Mining Uncertain Data
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Probabilistic databases: diamonds in the dirt
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Probabilistic nearest-neighbor query on uncertain objects
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Superseding Nearest Neighbor Search on Uncertain Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
A novel probabilistic pruning approach to speed up similarity queries in uncertain databases
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Geometric Approximation Algorithms
Geometric Approximation Algorithms
Closest pair and the post office problem for stochastic points
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Nearest-neighbor searching under uncertainty
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
| Hi-index | 0.00 |
Nearest-neighbor (NN) search, which returns the nearest neighbor of a query point in a set of points, is an important and widely studied problem in many fields, and it has wide range of applications. In many of them, such as sensor databases, location-based services, face recognition, and mobile data, the location of data is imprecise. We therefore study nearest neighbor queries in a probabilistic framework in which the location of each input point is specified as a probability distribution function. We present efficient algorithms for (i) computing all points that are nearest neighbors of a query point with nonzero probability; (ii) estimating, within a specified additive error, the probability of a point being the nearest neighbor of a query point; (iii) using it to return the point that maximizes the probability being the nearest neighbor, or all the points with probabilities greater than some threshold to be the NN. We also present some experimental results to demonstrate the effectiveness of our approach.