Sciweavers

288 search results - page 41 / 58
» random 1998
Sort
View
TIT
1998
102views more  TIT 1998»
15 years 1 days ago
On Characterization of Entropy Function via Information Inequalities
—Given n discrete random variables = fX1;111; Xng, associated with any subset of f1; 2; 111; ng, there is a joint entropy H(X ) where X = fXi:i 2 g. This can be viewed as a f...
Zhen Zhang, Raymond W. Yeung
RANDOM
1998
Springer
15 years 4 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
INFOCOM
1998
IEEE
15 years 4 months ago
Explicit Window Adaptation: A Method to Enhance TCP Performance
We study the performance of TCP in an internetwork consisting of both rate-controlled and non-rate-controlled segments. A commonexample of such an environment occurs when the end ...
Lampros Kalampoukas, Anujan Varma, K. K. Ramakrish...
WSC
1998
15 years 1 months ago
A Comparison of RESTART Implementations
The RESTART method is a widely applicable simulation technique for the estimation of rare event probabilities. The method is based on the idea to restart the simulation in certain...
Marnix J. J. Garvels, Dirk P. Kroese
TIT
1998
70views more  TIT 1998»
15 years 1 days ago
Reduced-Redundancy Product Codes for Burst Error Correction
In a typical burst-error correction application of a product code of nv nh arrays, one uses an [nh; nh rh] code Ch that detects corrupted rows, and an [nv; nv rv] code Cv that is...
Ron M. Roth, Gadiel Seroussi