12 search results - page 1 / 3 » Sharpness: A Tight Condition for Scalability |
SIROCCO
2008
13 years 6 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
COLT
2006
Springer
13 years 8 months ago
2006
Springer
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Abstract—We consider the problem of side-information scalable (SI-scalable) source coding, where the encoder constructs a two-layer description, such that the receiver with high ...
DATE
2004
IEEE
13 years 8 months ago
2004
IEEE
Emerging embedded system applications in multimedia and image processing are characterized by complex control flow consisting of deeply nested conditionals and loops. We present a...