This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. The cost cx has toâ€¦ (More)

Abstract. We consider an alphabet Î£= {a 1 ,\ldots,a n } with corresponding symbol probabilities p 1 ,\ldots,p n . For each prefix code associated to Î£ , let l i be the length of the codewordâ€¦ (More)

In several applications of automatic diagnosis and active learning a central problem is the evaluation of a discrete function by adaptively querying the values of its variables until the values readâ€¦ (More)

A static Hu man code for a given source alphabet fa1; : : : ; ang is a pre x code generated by Hu man's algorithm. Such a code minimizes P n i=1 wili among all pre x codes, where wi is the weight ofâ€¦ (More)

We determine the complexity of evaluatingmonotone Boolean functions in a variant of the decision tree model introduced in [Charikar et al. 2002]. In thismodel, reading different variables can incurâ€¦ (More)

Consider a website containing a collection of webpages with data such as in Yahoo or the Open Directory project. Each page is associated with a weight representing the frequency with which that pageâ€¦ (More)

We present a novel approach for computing all maximum consecutive subsums in a sequence of positive integers in near linear time. Solutions for this problem over binary sequences can be used forâ€¦ (More)