DBScholar

Back to papers

On Computing Functions with Uncertainty

Summary: Adaptive probing to compute f(x1..xn) when each xi is only known to lie in an interval and probes are costly; objective: minimize probe cost while guaranteeing f within specified precision for all realizations. Presents online, competitive (asymptotically optimal) algorithms for selection, aggregation (sum/avg) and their compositions under three precision models. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1233
Venue
PODS
Year
2001
Pagerank
7.0158184e-05
Overall Rank
3,923 | 73.09%
DOI
10.1145/375551.375577

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{khanna_pods01,
        address = {New York, NY, USA},
        series = {{PODS} '01},
        title = {{On Computing Functions with Uncertainty}},
        url = {https://dl.acm.org/doi/10.1145/375551.375577},
        doi = {10.1145/375551.375577},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Khanna, Sanjeev and Tan, Wang-Chiew},
        year = {2001}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 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