Sciweavers

2612 search results - page 19 / 523
» Switching Graphs and Their Complexity
Sort
View
ICPR
2008
IEEE
14 years 4 months ago
Birkhoff polytopes, heat kernels and graph complexity
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
Francisco Escolano, Edwin R. Hancock, Miguel Angel...
ICCAD
1994
IEEE
139views Hardware» more  ICCAD 1994»
14 years 1 months ago
Switching activity analysis considering spatiotemporal correlations
This work presents techniques for computing the switching activities of all circuit nodes under pseudorandom or biased input sequences and assuming a zero delay mode of operation....
Radu Marculescu, Diana Marculescu, Massoud Pedram
GD
2009
Springer
14 years 1 months ago
Complexity of Some Geometric and Topological Problems
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
Marcus Schaefer
ISCAS
2006
IEEE
109views Hardware» more  ISCAS 2006»
14 years 3 months ago
Network-on-chip quality-of-service through multiprotocol label switching
Abstract— Providing Quality-of-Service (QoS) in networks-onchip (NoCs) will be an important consideration for the complex multiprocessor chips of the future. In this paper, we di...
Manho Kim, Daewook Kim, Gerald E. Sobelman
FPL
2004
Springer
100views Hardware» more  FPL 2004»
14 years 1 months ago
On Optimal Irregular Switch Box Designs
In this paper, we develop a unified theory in analyzing optimal switch box design problems, particularly for the unsolved irregular cases, where different pin counts are allowed on...
Hongbing Fan, Yu-Liang Wu, Chak-Chung Cheung, Jipi...