Sciweavers

279 search results - page 32 / 56
» Approximating Average Parameters of Graphs
Sort
View
WDAG
2009
Springer
147views Algorithms» more  WDAG 2009»
14 years 2 months ago
Compact Routing in Power-Law Graphs
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
Wei Chen, Christian Sommer 0002, Shang-Hua Teng, Y...
SIAMCOMP
2010
147views more  SIAMCOMP 2010»
13 years 6 months ago
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
BIOCOMP
2008
13 years 9 months ago
Prediction of Protein Function Using Graph Container and Message Passing
We introduce a novel parameter called container flux, which is used to measure the information sharing capacity between two distinct nodes in a graph. Other useful information, bot...
Hongbo Zhou, Qiang Shawn Cheng, Mehdi Zargham
DAC
2005
ACM
14 years 8 months ago
Full-chip analysis of leakage power under process variations, including spatial correlations
In this paper, we present a method for analyzing the leakage current, and hence the leakage power, of a circuit under process parameter variations that can include spatial correla...
Hongliang Chang, Sachin S. Sapatnekar
VLSID
2008
IEEE
153views VLSI» more  VLSID 2008»
14 years 8 months ago
Total Power Minimization in Glitch-Free CMOS Circuits Considering Process Variation
Compared to subthreshold leakage, dynamic power is normally much less sensitive to the process variation due to its approximately linear relation to the process parameters. Howeve...
Yuanlin Lu, Vishwani D. Agrawal