[PDF][PDF] Computing the median with uncertainty

T Feder, R Motwani, R Panigrahy, C Olston… - Proceedings of the thirty …, 2000 - dl.acm.org
T Feder, R Motwani, R Panigrahy, C Olston, J Widom
Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000dl.acm.org
We consider a new model for computing with uncertainty. It is desired to compute a function f
(X1,..., Xn) where X1,..•, X,~ are unknown, but guaranteed to lie in specified intervals I1,..•, I~.
It is possible to query the precise value of any~ k" 3 at a cost cj. The goal is to pin down the
value of f to within a precision 6 at a minimum possible cost. We focus on the selection
function f which returns the value of the kth smallest argument. We present optimal offline
and online algorithms for this problem.
Abstract
We consider a new model for computing with uncertainty. It is desired to compute a function f (X1,..., Xn) where X1,..•, X,~ are unknown, but guaranteed to lie in specified intervals I1,..•, I~. It is possible to query the precise value of any~ k" 3 at a cost cj. The goal is to pin down the value of f to within a precision 6 at a minimum possible cost. We focus on the selection function f which returns the value of the kth smallest argument. We present optimal offline and online algorithms for this problem.
ACM Digital Library
Showing the best result for this search. See all results