364 search results - page 3 / 73 » Computing Communities in Large Networks Using Random Walks |
ICDM
2009
IEEE
13 years 11 months 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 ...
CCGRID
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
ASPDAC
2007
ACM
13 years 8 months ago
2007
ACM
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
Network querying aims to search a large network for subnetwork regions that are similar to a given query network. In this paper, we propose a novel algorithm for querying large sc...
WSC
2007
13 years 7 months ago
2007
We consider the problem of efficient estimation of first passage time probabilities for a multidimensional random walk with t distributed increments, via simulation. In addition...