767 search results - page 34 / 154 » On Clustering Using Random Walks |
138
click to vote
DIALM
2008
ACM
15 years 4 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
102
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
117
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—This paper presents Respondent-Driven Sampling (RDS) as a promising technique to derive unbiased estimates of node properties in unstructured overlay networks such as Gnutella. ...
124
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—In this paper, we examine the asymptotic behavior of degree correlation (i.e., the joint degree distribution of adjacent nodes) in several scale-free topology generators GED [13...
128
click to vote
WWW
2010
ACM
15 years 9 months ago
2010
ACM
Query suggestion has been an effective approach to help users narrow down to the information they need. However, most of existing studies focused on only popular/head queries. Si...