89 search results - page 2 / 18 » Hierarchical random-walk algorithms for power grid analysis |
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
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 ...
FSTTCS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
ASPDAC
2004
ACM
13 years 10 months ago
2004
ACM
Abstract— This paper presents a power grid analyzer that combines a divide-and-conquer strategy with a random-walk engine. A single-level hierarchical method is first described ...
DAC
2005
ACM
13 years 7 months ago
2005
ACM
On-chip supply networks are playing an increasingly important role for modern nanometer-scale designs. However, the ever growing sizes of power grids make the analysis problem ext...