168 search results - page 27 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
128
Voted
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
107
Voted
ICS
2010
Tsinghua U.
15 years 11 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
133
Voted
PODC
2003
ACM
15 years 7 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
141
Voted
CIAC
2010
Springer
15 years 6 months ago
2010
Springer
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...