2084 search results - page 202 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
132
Voted
ICDCS
2007
IEEE
15 years 6 months ago
2007
IEEE
In recent work, we proposed D-Trigger, a framework for tracking a global condition over a large network that allows us to detect anomalies while only collecting a very limited amo...
213
Voted
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
123
Voted
RTSS
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper presents a process algebra for specifying soft real-time constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arb...
143
click to vote
CLUSTER
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract. We describe and evaluate the Running Time Advisor (RTA), a system that can predict the running time of a compute-bound task on a typical shared, unreserved commodity host...
110
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...