Sciweavers

21 search results - page 3 / 5
» Incremental physical resynthesis for timing optimization
Sort
View
CAINE
2003
13 years 9 months ago
Semi Greedy Algorithm for Finding Connectivity in Microchip Physical Layouts
Scan based or Line Sweep methods are a traditional mechanism to traverse the physical layout, or artwork of a microchip. These traversals are incremental in nature. They typically...
Clemente Izurieta
CP
2003
Springer
14 years 22 days ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
DAC
2005
ACM
13 years 9 months ago
How accurately can we model timing in a placement engine?
This paper presents a novel placement algorithm for timing optimization based on a new and powerful concept, which we term differential timing analysis. Recognizing that accurate ...
Amit Chowdhary, Karthik Rajagopal, Satish Venkates...
TOG
2012
208views Communications» more  TOG 2012»
11 years 10 months ago
Video-based 3D motion capture through biped control
Marker-less motion capture is a challenging problem, particularly when only monocular video is available. We estimate human motion from monocular video by recovering three-dimensi...
Marek Vondrak, Leonid Sigal, Jessica K. Hodgins, O...
ICCAD
2005
IEEE
98views Hardware» more  ICCAD 2005»
14 years 4 months ago
Clustering for processing rate optimization
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
Chuan Lin, Jia Wang, Hai Zhou