Sciweavers

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

33

APWEB
2010
Springer

favoriteEmaildiscussreport

173views Internet Technology» more APWEB 2010»

A Space and Time Efficient Algorithm for SimRank Computation

13 years 11 months ago

A Space and Time Efficient Algorithm for SimRank Computation

Download www.cse.unsw.edu.au

SimRank has been proposed to rank web documents based on a graph model on hyperlinks. The existing techniques for conducting SimRank computation adopt an iteration computation paradigm. The most efficient technique has the time complexity O ( n3 ) with the space requirement O ( n2 ) in the worst case for each iteration where n is the number of nodes (web documents). In this paper, we propose novel optimization techniques such that each iteration takes the time O (min {n

Weiren Yu, Xuemin Lin, Jiajin Le

Real-time Traffic

APWEB 2010 | Internet Technology | Iteration | Iteration Computation Paradigm | Web Documents |

claim paper

Related Content

» Accuracy estimate and optimization techniques for SimRank computation

» Taming Computational Complexity Efficient and Parallel SimRank Optimizations on Undirected...

» TimeSpace Efficient Simulations of Quantum Computations

» Efficient Timing Analysis Algorithms for Timed State Space Exploration

» A space efficient algorithm for group structure computation

» Saving Space in a Time Efficient Simulation Algorithm

» An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches

» Space Efficient Algorithms for Ordered Tree Comparison

» Suffix Vector Space and TimeEfficient Alternative to Suffix Trees

Post Info
More Details (n/a)

Added	06 Dec 2010
Updated	06 Dec 2010
Type	Conference
Year	2010
Where	APWEB
Authors	Weiren Yu, Xuemin Lin, Jiajin Le

Comments (0)