Sciweavers

25 search results - page 4 / 5
» Chromatic capacity and graph operations
Sort
View
ASPDAC
2004
ACM
120views Hardware» more  ASPDAC 2004»
13 years 11 months ago
Temporal floorplanning using 3D-subTCG
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang, Hsin-...
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
14 years 6 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
ICCAD
2001
IEEE
126views Hardware» more  ICCAD 2001»
14 years 2 months ago
Constraint Satisfaction for Relative Location Assignment and Scheduling
Tight data- and timing constraints are imposed by communication and multimedia applications. The architecture for the embedded processor imply resource constraints. Instead of ran...
Carlos A. Alba Pinto, Bart Mesman, Jochen A. G. Je...
JCP
2006
128views more  JCP 2006»
13 years 5 months ago
A Service Oriented Framework for Multimedia Radio Networks
- In order to enable fast deployment of new emerging services over multimedia radio networks, it is important to design an efficient service-based platform with necessary traffic m...
Asma Ben Letaifa, Sami Tabbane, Zièd Chouka...
TCAD
2002
98views more  TCAD 2002»
13 years 5 months ago
An Esterel compiler for large control-dominated systems
Embedded hard real-time software systems often need fine-grained parallelism and precise control of timing, things typical real-time operating systems do not provide. The Esterel l...
Stephen A. Edwards