1186 search results - page 10 / 238 » Improving Random Walk Performance |
CN
1999
13 years 9 months ago
1999
Recent researchhas studied howto measurethe size of a searchengine, in terms of the number of pages indexed. In this paper, we consider a di erent measure for search engines, name...
KDD
2007
ACM
14 years 10 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
EJC
2007
13 years 9 months ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
KDD
2010
ACM
14 years 1 months 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...