Sciweavers

54 search results - page 1 / 11
» New Algorithms for Minimum Area k-gons
Sort
View
SODA
1992
ACM
109views Algorithms» more  SODA 1992»
13 years 6 months ago
New Algorithms for Minimum Area k-gons
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
David Eppstein
DAC
1997
ACM
13 years 9 months ago
An Improved Algorithm for Minimum-Area Retiming
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
Naresh Maheshwari, Sachin S. Sapatnekar
IJCGA
1998
97views more  IJCGA 1998»
13 years 4 months ago
Triangulation of Branching Contours Using Area Minimization
This paper presents a new method for reconstructing piecewise linear surfaces from planar polygonal contours that branch. For non-branching contours, experience has shown that the...
Mu Hong, Thomas W. Sederberg, Kris Klimaszewski, K...
DAC
2007
ACM
14 years 6 months ago
Optimization of Area in Digital FIR Filters using Gate-Level Metrics
In the paper, we propose a new metric for the minimization of area in the generic problem of multiple constant multiplications, and demonstrate its effectiveness for digital FIR f...
Eduardo A. C. da Costa, José C. Monteiro, L...
ASPDAC
2006
ACM
103views Hardware» more  ASPDAC 2006»
13 years 11 months ago
Low area pipelined circuits by multi-clock cycle paths and clock scheduling
— A new algorithm is proposed to reduce the number of intermediate registers of a pipelined circuit using a combination of multi-clock cycle paths and clock scheduling. The algor...
Bakhtiar Affendi Rosdi, Atsushi Takahashi