Sciweavers

Share
57 search results - page 1 / 12
» On random walks in direction-aware network problems
Sort
View
ASPDAC
2009
ACM
115views Hardware» more  ASPDAC 2009»
9 years 2 months ago
Incremental and on-demand random walk for iterative power distribution network analysis
— 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...
Yiyu Shi, Wei Yao, Jinjun Xiong, Lei He
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
9 years 2 months ago
Improving partial cover of Random Walks in large-scale Wireless Sensor Networks
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
Leonidas Tzevelekas, Ioannis Stavrakakis
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
9 years 3 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—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 ...
Jing Xia, Doina Caragea, William H. Hsu
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
9 years 9 days ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- 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...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...
books