Sciweavers

565 search results - page 51 / 113
» Geometry of Upper Probabilities
Sort
View
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 10 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
14 years 4 months ago
An Analysis of Random-Walk Cuckoo Hashing
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
Alan M. Frieze, Páll Melsted, Michael Mitze...
FCT
2003
Springer
14 years 3 months ago
An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and to several other known probabilistic tests. EQFT takes time equival...
Ivan Damgård, Gudmund Skovbjerg Frandsen
SUTC
2010
IEEE
14 years 1 months ago
A Log-Ratio Information Measure for Stochastic Sensor Management
—In distributed sensor networks, computational and energy resources are in general limited. Therefore, an intelligent selection of sensors for measurements is of great importance...
Daniel Lyons, Benjamin Noack, Uwe D. Hanebeck
MFCS
1995
Springer
14 years 1 months ago
Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities
Let ≤r and ≤s be two binary relations on 2N which are meant as reducibilities. Let both relations be closed under finite variation (of their set arguments) and consider the un...
Wolfgang Merkle, Yongge Wang