12 search results - page 1 / 3 » Incremental and on-demand random walk for iterative power di... |
ASPDAC
2009
ACM
13 years 11 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
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 ...
ICDM
2010
IEEE
13 years 2 months ago
2010
IEEE
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
PVLDB
2010
12 years 11 months ago
2010
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
TSP
2008
13 years 4 months ago
2008
Graphical models provide a powerful formalism for statistical signal processing. Due to their sophisticated modeling capabilities, they have found applications in a variety of fie...