Sciweavers

324 search results - page 7 / 65
» Efficient Approximation Algorithms for Floorplan Area Minimi...
Sort
View
DAC
2006
ACM
14 years 8 months ago
Optimization of area under a delay constraint in digital filter synthesis using SAT-based integer linear programming
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...
Eduardo A. C. da Costa, José Monteiro, Leve...
ICCAD
1995
IEEE
163views Hardware» more  ICCAD 1995»
13 years 11 months ago
Signal integrity optimization on the pad assignment for high-speed VLSI design
Pad assignment with signal integrity optimization is very important for high-speed VLSI design. In this paper, an efficient method is proposed to effectively minimize both simulta...
Kai-Yuan Chao, D. F. Wong
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
14 years 5 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
ICML
1994
IEEE
13 years 11 months ago
Efficient Algorithms for Minimizing Cross Validation Error
Model selection is important in many areas of supervised learning. Given a dataset and a set of models for predicting with that dataset, we must choose the model which is expected...
Andrew W. Moore, Mary S. Lee
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
13 years 11 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre