Sciweavers

2612 search results - page 13 / 523
» Switching Graphs and Their Complexity
Sort
View
ISLPED
2004
ACM
153views Hardware» more  ISLPED 2004»
14 years 3 months ago
Any-time probabilistic switching model using bayesian networks
Modeling and estimation of switching activities remain to be important problems in low-power design and fault analysis. A probabilistic Bayesian Network based switching model can ...
Shiva Shankar Ramani, Sanjukta Bhanja
PRIS
2001
13 years 11 months ago
Improving the Robustness of Parametric Shape Tracking with Switched Multiple Models
This paper addresses the problem of tracking objects with complex motion dynamics or shape changes. It is assumed that some of the visual features detected in the image (e.g., edg...
Jacinto C. Nascimento, Jorge S. Marques
DM
2007
125views more  DM 2007»
13 years 9 months ago
Generalized switch-setting problems
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
Torsten Muetze
ICC
2008
IEEE
126views Communications» more  ICC 2008»
14 years 4 months ago
Backlog Aware Scheduling for Large Buffered Crossbar Switches
—A novel architecture was proposed in [1] to address scalability issues in large, high speed packet switches. The architecture proposed in [1], namely OBIG (output buffers with i...
Aditya Dua, Benjamin Yolken, Nicholas Bambos, Wlad...
COMCOM
1999
122views more  COMCOM 1999»
13 years 9 months ago
An accurate performance model of shared buffer ATM switches under hot spot traffic
Asynchronous transfer mode (ATM) switches based on shared buffering are known to have better performance and buffer utilization than input or output queued switches. Shared buffer...
Mahmoud Saleh, Mohammed Atiquzzaman