In the above paper,1 an asymptotically tight upper bound on the th moment ( 0) of the minimal number of guesses required to determine the value of a random variable was derived. We show that we can tighten this bound for the case of positive integer moments (when = 1, the bound is improved by a factor of 2) and that the new bound also applies to a class of nonminimal guessing sequences.

In this paper we present the results of a method for decoding start codes and overhead information in an MPEG-4 bitstream using sequential decoding with soft channel values. We show that performance of sequential decoding is superior to that of hard decisions alone and can be further improved if probabilities of occurrence of the start codes are taken into consideration.

In this paper, a new notion of sequential compactness is introduced in L-topological spaces, which is called sequentially S∗-compactness. If L = [0, 1], sequential ultra-compactness, sequential N-compactness and sequential strong compactness imply sequential S∗-compactness, and sequential S∗-compactness implies sequential F-compactness. The intersection of a sequentially S∗-compact L-set and a ...

This paper presents the design and evaluation of a sequential access memory (SAM) that provides low power and high performance by replacing address decoders with special locally-communicating sequencers. A test chip containing one 16x16-b SAM and one 64x16-b SAM (consisting of four 16x16-b banks) has been designed, fabricated, and evaluated using a 0.25-μm CMOS process. With a clock frequency o...

We analyze a simple sequential algorithm (SA) for allocating indivisible items that are strictly ranked by n ≥ 2 players. It yields at least one Pareto-optimal allocation which, when n = 2, is envy-free unless no envy-free allocation exists. However, an SA allocation may not be maximin or Borda maximin—maximize the minimum rank, or the Borda score, of the items received by a player. Although SA...