Sciweavers

1405 search results - page 180 / 281
» Popularity at Minimum Cost
Sort
View
FOCS
2000
IEEE
15 years 8 months ago
Hierarchical Placement and Network Design Problems
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...
Sudipto Guha, Adam Meyerson, Kamesh Munagala
ICCAD
2000
IEEE
188views Hardware» more  ICCAD 2000»
15 years 8 months ago
Bus Optimization for Low-Power Data Path Synthesis Based on Network Flow Method
— Sub-micron feature sizes have resulted in a considerable portion of power to be dissipated on the buses, causing an increased attention on savings for power at the behavioral l...
Sungpack Hong, Taewhan Kim
147
Voted
ECCV
2000
Springer
15 years 8 months ago
Minimal Paths in 3D Images and Application to Virtual Endoscopy
This paper presents a new method to find minimal paths in 3D images, giving as initial data one or two endpoints. This is based on previous work [1] for extracting paths in 2D ima...
Thomas Deschamps, Laurent D. Cohen
135
Voted
DAC
1999
ACM
15 years 8 months ago
Automated Phase Assignment for the Synthesis of Low Power Domino Circuits
High performance circuit techniques such as domino logic have migrated from the microprocessor world into more mainstream ASIC designs. The problem is that domino logic comes at a...
Priyadarshan Patra, Unni Narayanan
ISPD
1999
ACM
108views Hardware» more  ISPD 1999»
15 years 8 months ago
On the behavior of congestion minimization during placement
Typical placement objectives involve reducing net-cut cost or minimizing wirelength. Congestion minimization is least understood, however, it models routability accurately. In thi...
Maogang Wang, Majid Sarrafzadeh