253 search results - page 50 / 51 » Random Walks with Look-Ahead in Scale-Free Random Graphs |
PVLDB
2010
13 years 1 months ago
2010
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
NIPS
2004
13 years 7 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
ICWSM
2009
13 years 4 months ago
2009
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...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
CIKM
2009
Springer
14 years 25 days ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...