253 search results - page 31 / 51 » Random Walks with Look-Ahead in Scale-Free Random Graphs |
121
click to vote
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...
100
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
SIROCCO
2010
15 years 1 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
SIGIR
2006
ACM
15 years 5 months ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...