5153 search results - page 175 / 1031 » Introduction to Randomized Algorithms |
112
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
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....
139
Voted
OPODIS
2010
15 years 28 days ago
2010
The need for efficient decentralized recommender systems has been appreciated for some time, both for the intrinsic advantages of decentralization and the necessity of integrating...
126
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
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 ...
WDAG
2009
Springer
15 years 9 months ago
2009
Springer
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...
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
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...