Sciweavers

398 search results - page 10 / 80
» Critical exponents of graphs
Sort
View
DATE
2007
IEEE
130views Hardware» more  DATE 2007»
14 years 4 months ago
A novel criticality computation method in statistical timing analysis
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
Feng Wang 0004, Yuan Xie, Hai Ju
CIAC
1997
Springer
154views Algorithms» more  CIAC 1997»
14 years 1 months ago
Isomorphism for Graphs of Bounded Distance Width
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fl...
CN
2002
78views more  CN 2002»
13 years 9 months ago
A stochastic model for the evolution of the Web
Recently several authors have proposed stochastic models of the growth of the Web graph that give rise to power-law distributions. These models are based on the notion of preferen...
Mark Levene, Trevor I. Fenner, George Loizou, Rich...
ISPASS
2006
IEEE
14 years 3 months ago
Critical path analysis of the TRIPS architecture
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...
Ramadass Nagarajan, Xia Chen, Robert G. McDonald, ...
KES
2005
Springer
14 years 3 months ago
Modeling the Discovery of Critical Utterances
The ubiquity of chance discovery can be seen in many areas of application, fundamentally when there are events that are difficult to find or predict. In this paper, we present our...
Calkin A. S. Montero, Yukio Ohsawa, Kenji Araki