1612 search results - page 189 / 323 » Analysing Randomized Distributed Algorithms |
104
click to vote
COCO
2009
Springer
15 years 6 months ago
2009
Springer
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
143
click to vote
AMAI
2005
Springer
15 years 2 months ago
2005
Springer
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
104
click to vote
SRDS
1999
IEEE
15 years 6 months ago
1999
IEEE
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer...
118
click to vote
RTSS
1998
IEEE
15 years 6 months ago
1998
IEEE
In this paper, we derive a statistical delay guarantee of the generalized Virtual Clock scheduling algorithm. We define the concept of an equivalent fluid and packet source and pr...
137
Voted
EUROPAR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In this work we study the dynamic one-to-one communication problem in energy- and capacity-constrained wireless ad-hoc networks. The performance of such networks is evalu...