Planar point location using persistent search trees
Communications of the ACM
Ray shooting and parametric search
SIAM Journal on Computing
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Approximation algorithms for aligning points
Proceedings of the nineteenth annual symposium on Computational geometry
Group Nearest Neighbor Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Aggregate Nearest Neighbor Queries in Road Networks
IEEE Transactions on Knowledge and Data Engineering
Two ellipse-based pruning methods for group nearest neighbor queries
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Approximation algorithms for spreading points
Journal of Algorithms
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Ranking queries on uncertain data: a probabilistic threshold approach
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
IEEE Transactions on Knowledge and Data Engineering
Efficient search for the top-k probable nearest neighbors in uncertain databases
Proceedings of the VLDB Endowment
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
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
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
Information Processing Letters
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Space-time tradeoffs for approximate nearest neighbor searching
Journal of the ACM (JACM)
Largest bounding box, smallest diameter, and related problems on imprecise points
Computational Geometry: Theory and Applications
Probabilistic nearest-neighbor query on uncertain objects
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Efficient methods in finding aggregate nearest neighbor by projection-based filtering
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Hausdorff distance under translation for points and balls
ACM Transactions on Algorithms (TALG)
Superseding Nearest Neighbor Search on Uncertain Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
VoR-tree: R-trees with Voronoi diagrams for efficient processing of spatial nearest neighbor queries
Proceedings of the VLDB Endowment
Preprocessing Imprecise Points and Splitting Triangulations
SIAM Journal on Computing
Flexible aggregate similarity search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
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
IEEE Transactions on Knowledge and Data Engineering
Nearest neighbor searching under uncertainty II
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.00 |
Nearest-neighbor queries, which ask for returning the nearest neighbor of a query point in a set of points, are important and widely studied in many fields because of a wide range of applications. In many of these applications, 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 and/or query point is specified as a probability density function and the goal is to return the point that minimizes the expected distance, which we refer to as the expected nearest neighbor (ENN). We present methods for computing an exact ENN or an ε-approximate ENN, for a given error parameter 0