Database Paper Browser

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
1234
Venue
PODS
Year
2001
Pagerank
6.7570059e-05
Overall Rank
3,801 | 73.56%
DOI
-

Incoming Non-self Citations Over Time

Authors

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