DBScholar

Back to papers

Nearest-Neighbor Searching Under Uncertainty

Summary: Handles nearest-neighbor queries under probabilistic location uncertainty (points/queries as PDFs), defining the expected nearest neighbor (ENN) objective. Gives first nontrivial exact and ε-approx ENN algorithms with near-linear indexes, polylog/sublinear queries and provable guarantees. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1579
Venue
PODS
Year
2012
Pagerank
6.480347e-05
Overall Rank
4,850 | 66.73%
DOI
10.1145/2213556.2213588

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{agarwal_pods12,
        address = {New York, NY, USA},
        series = {{PODS} '12},
        title = {{Nearest-Neighbor Searching Under Uncertainty}},
        url = {https://dl.acm.org/doi/10.1145/2213556.2213588},
        doi = {10.1145/2213556.2213588},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Agarwal, Pankaj K. and Efrat, Alon and Sankararaman, Swaminathan and Zhang, Wuzhou},
        year = {2012}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers