387 search results - page 6 / 78 » Many Random Walks Are Faster Than One |
ISPDC
2008
IEEE
14 years 3 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
SIAMAM
2000
13 years 8 months ago
2000
Abstract. In many biological examples of biased random walks, movement statistics are determined by state dynamics that are internal to the organism or cell and that mediate respon...
KDD
2010
ACM
14 years 26 days ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...