387 search results - page 5 / 78 » Many Random Walks Are Faster Than One |
157
click to vote
ICDM
2009
IEEE
16 years 8 days ago
2009
IEEE
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
192
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
179
click to vote
GCC
2003
Springer
15 years 10 months ago
2003
Springer
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
198
click to vote
DAMON
2008
Springer
15 years 7 months ago
2008
Springer
As access times to main memory and disks continue to diverge, faster non-volatile storage technologies become more attractive for speeding up data analysis applications. NAND flas...
149
click to vote
ACL
2009
15 years 3 months ago
2009
Opinion Question Answering (Opinion QA), which aims to find the authors' sentimental opinions on a specific target, is more challenging than traditional factbased question an...