Sciweavers

860 search results - page 6 / 172
» Biased Random Walks
Sort
View
PAMI
2011
14 years 10 months ago
Connectedness of Random Walk Segmentation
Connectedness of random walk segmentation is examined, and novel properties are discovered, by considering electrical circuits equivalent to random walks. A theoretical analysis s...
Ming-Ming Cheng, Guo-Xin Zhang
PAMI
2011
14 years 10 months ago
Connectedness of Random Walk Segmentation
Connectedness of random walk segmentation is examined, and novel properties are discovered, by considering electrical circuits equivalent to random walks. A theoretical analysis sh...
Ming-Ming Cheng, Guo-Xin Zhang
APPROX
2007
Springer
141views Algorithms» more  APPROX 2007»
15 years 10 months ago
The Cover Time of Random Digraphs
We study the cover time of a random walk on the random digraph Dn,p when np =
Colin Cooper, Alan M. Frieze
153
Voted
UAI
2003
15 years 5 months ago
Markov Random Walk Representations with Continuous Distributions
We propose a framework to extend Markov random walks (Szummer and Jaakkola, 2001) to a continuum of points. In this framework, the transition probability between two points is the...
Chen-Hsiang Yeang, Martin Szummer
141
Voted
WEBI
2005
Springer
15 years 9 months ago
WICER: A Weighted Inter-Cluster Edge Ranking for Clustered Graphs
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
Divya Padmanabhan, Prasanna Kumar Desikan, Jaideep...