Sciweavers

1510 search results - page 60 / 302
» Upper Probabilities and Additivity
Sort
View
INFOCOM
1995
IEEE
15 years 1 months ago
A Fast Bypass Algorithm for High-Speed Networks
In this work we suggest an algorithm that increases the reservation success probability for bursty tra c in high speed networks by adding exibility to the construction of the rout...
Israel Cidon, Raphael Rom, Yuval Shavitt
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
15 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
15 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
15 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
15 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