Sciweavers

545 search results - page 48 / 109
» Global Register Partitioning
Sort
View
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 3 months ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
ISPD
2005
ACM
116views Hardware» more  ISPD 2005»
14 years 2 months ago
A fast algorithm for power grid design
This paper presents an efficient heuristic algorithm to design a power distribution network of a chip by employing a successive partitioning and grid refinement scheme. In an it...
Jaskirat Singh, Sachin S. Sapatnekar
ISPD
1999
ACM
85views Hardware» more  ISPD 1999»
14 years 1 months ago
Optimal partitioners and end-case placers for standard-cell layout
We study alternatives to FM-based partitioning in the context of end-case processing for top-down standard-cell placement. The primary motivation is that small partitioning instan...
Andrew E. Caldwell, Andrew B. Kahng, Igor L. Marko...
ECRTS
2008
IEEE
14 years 3 months ago
Hierarchical Scheduling Framework for Virtual Clustering of Multiprocessors
Scheduling of sporadic task systems on multiprocessor platforms is an area which has received much attention in the recent past. It is widely believed that finding an optimal sch...
Insik Shin, Arvind Easwaran, Insup Lee
ICIP
2006
IEEE
14 years 10 months ago
Unsupervised Simultaneous Registration and Exposure Correction
Early approaches to building mosaics by composing photographic images, assume the input images have similar exposures. Since this is unlikely to happen in practice, it became comm...
Pedro M. Q. Aguiar