1254 search results - page 163 / 251 » Making Hard Problems Harder |
141
click to vote
SAC
2006
ACM
15 years 9 months ago
2006
ACM
In a recent work, we have shown that it is not possible to dependably build any type of distributed f fault or intrusiontolerant system under the asynchronous model. This result f...
121
click to vote
SIGIR
2006
ACM
15 years 9 months ago
2006
ACM
Large scale learning is often realistic only in a semi-supervised setting where a small set of labeled examples is available together with a large collection of unlabeled data. In...
126
click to vote
SIGMETRICS
2006
ACM
15 years 9 months ago
2006
ACM
We consider a system with two service classes with heterogeneous traffic characteristics and Quality-of-Service requirements. The available bandwidth is shared between the two tra...
138
click to vote
MIR
2005
ACM
15 years 8 months ago
2005
ACM
It is estimated that less than ten percent of the world’s species have been discovered and described. The main reason for the slow pace of new species description is that the sc...
118
click to vote
PODC
2005
ACM
15 years 8 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...