This paper describes a generalized version of the variable elimination algorithm for Bayesian networks. Variable elimination computes the marginal probability for some specified set of variables in a network. The algorithm consists of a single pass through a list of data structures called buckets. The generalization presented here adds a second pass to the algorithm and produces the marginal pr...

We present a scalable distributed data structure called LH*. LH* generalizes Linear Hashing (LH) to distributed RAM and disk les. An LH* le can be created from records with primary keys, or objects with OIDs, provided by any number of distributed and autonomous clients. It does not require a central directory, and grows gracefully, through splits of one bucket at a time, to virtually any number...

The MPEG coding scheme is expected to be the compression algorithm for the future ATM video applications. On account of its wide variability and the type of coding used, Policing of MPEG traac is critical. Leaky Bucket algorithm has been the conventional method used for policing the network traac. Due to the nature of the MPEG video stream, a single Leaky Bucket based on a single (;) envelope h...

We study a particular aspect of the balanced allocation paradigm (also known as the “twochoices paradigm”): constant sized bins, packed as tightly as possible. Let d ≥ 1 be fixed, and assume there are m bins of capacity d each. To each of n ≤ dm balls two possible bins are assigned at random. How close can dm/n = 1+ε be to 1 so that with high probability each ball can be put into one of the two...

We study the broadcasting problem when underlying tree is a random recursive tree. The root of has bit value assigned. Every other vertex same as its parent with probability 1?q and opposite q, where q?[0,1]. consists in estimating upon observing unlabeled tree, together associated every vertex. In more difficult version problem, observed but only values leaves are observed. When uniform both v...