Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

WAIM
2010
Springer

favoriteEmaildiscussreport

183views Information Technology» more WAIM 2010»

Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs

13 years 2 months ago

Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs

Download www.cse.unsw.edu.au

SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investigate the optimization problem of SimRank similarity computation on undirected web graphs. We first present a novel algorithm to estimate the SimRank between vertices in O n3 + K

Weiren Yu, Xuemin Lin, Jiajin Le

Real-time Traffic

Algorithm | Information Technology | SimRank | SimRank Algorithm | WAIM 2010 |

claim paper

Related Content

» A Space and Time Efficient Algorithm for SimRank Computation

» Efficient parallel and out of core algorithms for constructing large bidirected de Bruijn ...

» Parallel external memory graph algorithms

» Reducing IO Complexity by Simulating Coarse Grained Parallel Algorithms

» BioGraphE highperformance bionetwork analysis using the Biological Graph Environment

» Optimalstretch nameindependent compact routing in doubling metrics

» EnergyEfficient Task Mapping for DataDriven Sensor Network Macroprogramming

» Fast distributed random walks

» Scheduling optimization through iterative refinement

Post Info
More Details (n/a)

Added	15 Feb 2011
Updated	15 Feb 2011
Type	Journal
Year	2010
Where	WAIM
Authors	Weiren Yu, Xuemin Lin, Jiajin Le

Comments (0)