Search Sciweavers | Sciweavers

2463 search results - page 18 / 493

» Rankings of Directed Graphs

click to vote

WAW
2010
Springer

306views Algorithms» more WAW 2010»

Finding and Visualizing Graph Clusters Using PageRank Optimization

13 years 5 months ago

Download www.math.ucsd.edu

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

claim paper

Read More »

click to vote

WSDM
2009
ACM

125views Data Mining» more WSDM 2009»

Less is more: sampling the neighborhood graph makes SALSA better and faster

14 years 2 months ago

Download wsdm2009.org

In this paper, we attempt to improve the eﬀectiveness and the eﬃciency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...

Marc Najork, Sreenivas Gollapudi, Rina Panigrahy

claim paper

Read More »

click to vote

AINA
2004
IEEE

149views Computer Networks» more AINA 2004»

Parallel PageRank Computation on a Gigabit PC Cluster

13 years 11 months ago

Download mike.cpe.ku.ac.th

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

claim paper

Read More »

click to vote

WAW
2007
Springer

77views Algorithms» more WAW 2007»

Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms

14 years 1 months ago

Download research.microsoft.com

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

claim paper

Read More »

click to vote

COMBINATORICS
2000

71views more COMBINATORICS 2000»

Low Rank Co-Diagonal Matrices and Ramsey Graphs

13 years 7 months ago