2084 search results - page 407 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
DRM
2004
Springer
15 years 3 months ago
2004
Springer
Once electronic content has been released it is very difficult to prevent copies of the content from being widely distributed. Such distribution can cause economic harm to the con...
110
click to vote
ICS
2011
Tsinghua U.
14 years 1 months ago
2011
Tsinghua U.
The probability that a failure will occur before the end of the computation increases as the number of processors used in a high performance computing application increases. For l...
164
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
DFG
2009
Springer
15 years 4 months ago
2009
Springer
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
HPDC
2010
IEEE
14 years 10 months ago
2010
IEEE
Clusters are mostly used through Resources Management Systems (RMS) with a static allocation of resources for a bounded amount of time. Those approaches are known to be insufficie...