Sciweavers

1434 search results - page 52 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
PODC
2012
ACM
11 years 10 months ago
Faster randomized consensus with an oblivious adversary
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
James Aspnes
FOCS
2004
IEEE
13 years 11 months ago
Extracting Randomness Using Few Independent Sources
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...
Boaz Barak, Russell Impagliazzo, Avi Wigderson
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 7 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
ICPR
2002
IEEE
14 years 8 months ago
Illumination Invariant Segmentation of Spatio-Temporal Images by Spatio-Temporal Markov Random Field Model
For many years, object tracking in images has suffered from the problems of occlusions and illumination effects. In order to resolve occlusion problems, we have been proposing the...
Shunsuke Kamijo, Katsushi Ikeuchi, Masao Sakauchi
IPPS
2007
IEEE
14 years 1 months ago
Spinneret: A Log Random Substrate for P2P Networks
Until now, structured and unstructured networks have been considered in absentia of each other. We believe that next-generation P2P services will require both structured and unstr...
Jeff Rose, Cyrus P. Hall, Antonio Carzaniga