3415 search results - page 246 / 683 » Lower bounds on kernelization |
160
click to vote
SIGMETRICS
2008
ACM
15 years 6 months ago
2008
ACM
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
219
click to vote
ICALP
2009
Springer
16 years 7 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...
252
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
159
click to vote
PODC
2003
ACM
15 years 12 months ago
2003
ACM
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
161
click to vote
WDAG
1990
Springer
15 years 10 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...