Sciweavers

733 search results - page 6 / 147
» Recommending random walks
Sort
View
PAMI
2011
14 years 4 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 3 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
UAI
2003
14 years 11 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
ICWSM
2009
14 years 7 months ago
Content Based Recommendation and Summarization in the Blogosphere
This paper presents a stochastic graph based method for recommending or selecting a small subset of blogs that best represents a much larger set. within a certain topic. Each blog...
Ahmed Hassan, Dragomir R. Radev, Junghoo Cho, Amru...
61
Voted
WWW
2009
ACM
15 years 10 months ago
Tag ranking
Social media sharing web sites like Flickr allow users to annotate images with free tags, which significantly facilitate Web image search and organization. However, the tags assoc...
Dong Liu, Xian-Sheng Hua, Linjun Yang, Meng Wang, ...