Sciweavers

817 search results - page 38 / 164
» An Optimal Linear Time Algorithm for Quasi-Monotonic Segment...
Sort
View
ICCD
2004
IEEE
106views Hardware» more  ICCD 2004»
14 years 5 months ago
A New Statistical Optimization Algorithm for Gate Sizing
— In this paper, we approach the gate sizing problem in VLSI circuits in the context of increasing variability of process and circuit parameters as technology scales into the nan...
Murari Mani, Michael Orshansky
CORR
2007
Springer
111views Education» more  CORR 2007»
13 years 8 months ago
Comments on "Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy
Min, Veeravalli, and Barlas have proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more ...
Matthieu Gallet, Yves Robert, Frédér...
DAC
2007
ACM
14 years 9 months ago
An Integer Linear Programming Based Routing Algorithm for Flip-Chip Design
The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literatur...
Jia-Wei Fang, Chin-Hsiung Hsu, Yao-Wen Chang
ECCV
2006
Springer
14 years 10 months ago
Accelerated Convergence Using Dynamic Mean Shift
Mean shift is an iterative mode-seeking algorithm widely used in pattern recognition and computer vision. However, its convergence is sometimes too slow to be practical. In this pa...
Kai Zhang, James T. Kwok, Ming Tang
MOR
2002
94views more  MOR 2002»
13 years 8 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel