186 search results - page 8 / 38 » Speeding up algorithms on compressed web graphs |
WWW
2003
ACM
14 years 8 months ago
2003
ACM
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...
BIRTHDAY
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within m...
AIPS
2008
13 years 10 months ago
2008
High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a p...
IFL
1997
Springer
13 years 11 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...