Sciweavers

5138 search results - page 187 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
Reliability in Layered Networks with Random Link Failures
—We consider network reliability in layered networks where the lower layer experiences random link failures. In layered networks, each failure at the lower layer may lead to mult...
Kayi Lee, Hyang-Won Lee, Eytan Modiano
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
15 years 7 months ago
PageRank and the random surfer model
In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al....
Prasad Chebolu, Páll Melsted
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
16 years 1 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...
WDAG
2009
Springer
91views Algorithms» more  WDAG 2009»
16 years 1 months ago
Randomization Can Be a Healer: Consensus with Dynamic Omission Failures
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
16 years 18 days ago
Eigenvectors of Random Graphs: Nodal Domains
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relati...
Yael Dekel, James R. Lee, Nathan Linial