4052 search results - page 5 / 811 » Computing personalized pageranks |
124
Voted
AAAI
2011
13 years 9 months ago
2011
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
110
click to vote
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
84
Voted
PDP
2006
IEEE
15 years 3 months ago
2006
IEEE
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
TREC
2008
14 years 11 months ago
2008
PageRank is a way to rank Web pages taking into account hyper-link structure of the Web. PageRank provides efficient and simple method to find out ranking of Web pages exploiting ...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
The enormity and rapid growth of the web-graph forces quantities such as its pagerank to be computed under missing information consisting of outlinks of pages that have not yet be...