2254 search results - page 339 / 451 » Computing the minimal covering set |
168
click to vote
DCC
2008
IEEE
16 years 5 months ago
2008
IEEE
We study the Tardos' probabilistic fingerprinting scheme and show that its codeword length may be shortened by a factor of approximately 4. We achieve this by retracing Tardo...
164
click to vote
DCC
2007
IEEE
16 years 5 months ago
2007
IEEE
A linear (qd, q, t)-perfect hash family of size s in a vector space V of order qd over a field F of order q consists of a set S = {1, . . . , s} of linear functionals from V to F ...
146
click to vote
DCC
2005
IEEE
16 years 5 months ago
2005
IEEE
Asymptotically optimal bit allocation among a set of quantizers for a finite collection of sources was determined in 1963 by Huang and Schultheiss. Their solution, however, gives ...
176
click to vote
ICDCS
2009
IEEE
16 years 3 months ago
2009
IEEE
Abstract: Current peer-to-peer systems are network-agnostic, often generating large volumes of unnecessary inter-ISP traffic. Although recent work has shown the benefits of ISP-a...
170
click to vote
SOFSEM
2010
Springer
16 years 2 months ago
2010
Springer
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...