210 search results - page 16 / 42 » Excludability and Bounded Computational Capacity |
132
click to vote
TIT
2008
15 years 3 months ago
2008
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
151
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
102
Voted
IH
2009
Springer
15 years 10 months ago
2009
Springer
This paper is concerned with the estimation of steganographic capacity in digital images, using information theoretic bounds and very large-scale experiments to approximate the dis...
148
Voted
EUROCRYPT
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
121
Voted
RTSS
2007
IEEE
15 years 9 months ago
2007
IEEE
We consider the issue of deadline tardiness under global multiprocessor scheduling algorithms. We present a general tardiness-bound derivation that is applicable to a wide variety...