Sciweavers

2463 search results - page 18 / 493
» Rankings of Directed Graphs
Sort
View
WAW
2010
Springer
306views Algorithms» more  WAW 2010»
14 years 9 months ago
Finding and Visualizing Graph Clusters Using PageRank Optimization
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
Fan Chung Graham, Alexander Tsiatas
WSDM
2009
ACM
125views Data Mining» more  WSDM 2009»
15 years 6 months ago
Less is more: sampling the neighborhood graph makes SALSA better and faster
In this paper, we attempt to improve the effectiveness and the efficiency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...
Marc Najork, Sreenivas Gollapudi, Rina Panigrahy
AINA
2004
IEEE
15 years 3 months ago
Parallel PageRank Computation on a Gigabit PC Cluster
Efficient computing the PageRank scores for a large web graph is actually one of the hot issues in Web-IR community. Recent researches propose to accelerate the computation, both ...
Bundit Manaskasemsak, Arnon Rungsawang
WAW
2007
Springer
77views Algorithms» more  WAW 2007»
15 years 5 months ago
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
Sreenivas Gollapudi, Marc Najork, Rina Panigrahy
COMBINATORICS
2000
71views more  COMBINATORICS 2000»
14 years 11 months ago
Low Rank Co-Diagonal Matrices and Ramsey Graphs
We examine n
Vince Grolmusz