220 search results - page 3 / 44 » Minimizing Average Flow-time : Upper and Lower Bounds |
CORR
2007
Springer
13 years 5 months ago
2007
Springer
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
MOC
2002
13 years 5 months ago
2002
This article deals with the digital inversive method for generating uniform pseudorandom numbers. Equidistribution and statistical independence properties of the generated pseudora...
PIMRC
2010
IEEE
13 years 3 months ago
2010
IEEE
We consider a point-to-point, correlated and block fading multiple antenna channel where the receiver has a noisy channel estimation and the transmitter has the statistics of the c...
WADS
2005
Springer
13 years 11 months ago
2005
Springer
We consider the lower bound for building a heap in the worst case and the upper bound in the average case. We will prove that the supposedly fastest algorithm in the average case[2...
DCC
2008
IEEE
14 years 5 months ago
2008
IEEE
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....