Fast and Exact Top-k Search for Random Walk with Restart Yasuhiro Fujiwara∗‡ , Makoto Nakatsuji† , Makoto Onizuka∗ , Masaru Kitsuregawa‡ ∗NTT Cyber Space Labs, †NTT Cyber Solutions Labs, ‡The University o

First Page		Document Content
Date: 2012-01-21 14:29:58 Network theory Chord Distributed data storage Connectivity Bridge Shortest path problem Topology LU decomposition Mathematics Graph theory Theoretical computer science		Fast and Exact Top-k Search for Random Walk with Restart Yasuhiro Fujiwara∗‡ , Makoto Nakatsuji† , Makoto Onizuka∗ , Masaru Kitsuregawa‡ ∗NTT Cyber Space Labs, †NTT Cyber Solutions Labs, ‡The University o Add to Reading List Source URL: vldb.org Download Document from Source Website File Size: 298,20 KB Share Document on Facebook

	Geometry & Topology–Topological properties of Hilbert schemes of almost-complex four-manifolds II DocID: 1xVL5 - View Document
	Algebraic & Geometric Topology–Generic representations of orthogonal groups: the mixed functors DocID: 1xVsM - View Document
	Geometry & Topology–K –duality for stratified pseudomanifolds C LAIRE D EBORD DocID: 1xVky - View Document
	NetHide: Secure and Practical Network Topology Obfuscation Roland Meier∗ , Petar Tsankov∗ , Vincent Lenders , Laurent Vanbever∗ , Martin Vechev∗ ∗ ETH Zürich DocID: 1xVcN - View Document
	NetHide: Secure and Practical Network Topology Obfuscation Roland Meier∗ , Petar Tsankov∗ , Vincent Lenders , Laurent Vanbever∗ , Martin Vechev∗ ∗ ETH Zürich DocID: 1xV3c - View Document