253 search results - page 44 / 51 » Random Walks with Look-Ahead in Scale-Free Random Graphs |
107
click to vote
CVPR
2011
IEEE
14 years 3 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
CIKM
2007
Springer
15 years 5 months ago
2007
Springer
Dictionary-based approaches to query translation have been widely used in Cross-Language Information Retrieval (CLIR) experiments. Using these approaches, translation has been not...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
108
click to vote
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
108
click to vote
WWW
2005
ACM
16 years 10 days ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...