1732 search results - page 103 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
156
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We consider the problem of minimizing the size of a set system G such that every subset of {1, . . . , n} can be written as a disjoint union of at most k members of G, where k and...
156
click to vote
INFOCOM
2005
IEEE
16 years 17 hour ago
2005
IEEE
Abstract—This paper presents an analytic framework to evaluate the performance of peer to peer (P2P) networks. Using the time to download or replicate an arbitrary file as the m...
173
click to vote
NPAR
2010
ACM
15 years 11 months ago
2010
ACM
Recent years have witnessed significant advances in 3D brush modeling and simulation in digital paint tools. Compared with traditional 2D brushes, a 3D brush can be both more intu...
172
click to vote
SPAA
2000
ACM
15 years 10 months ago
2000
ACM
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
167
click to vote
COCOON
2010
Springer
15 years 11 months ago
2010
Springer
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...