85 search results - page 6 / 17 » Component structure induced by a random walk on a random gra... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
ICDM
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
PDP
2006
IEEE
14 years 1 months ago
2006
IEEE
We explore the possibilities to organize a query data structure in the main memories or hard disks of a cluster computer. The query data structure serves to improve the performanc...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The regularization functional induced by the graph Laplacian of a random neighborhood graph based on the data is adaptive in two ways. First it adapts to an underlying ma...
CCR
2004
13 years 7 months ago
2004
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...