Sciweavers

241 search results - page 21 / 49
» Fast heuristics for large scale covering-location problems
Sort
View
DAC
2006
ACM
15 years 3 months ago
A fast on-chip decoupling capacitance budgeting algorithm using macromodeling and linear programming
We propose a novel and efficient charge-based decoupling capacitance budgeting algorithm. Our method uses the macromodeling technique and effective radius of decoupling capacitan...
Min Zhao, Rajendran Panda, Savithri Sundareswaran,...
FGR
2004
IEEE
161views Biometrics» more  FGR 2004»
15 years 1 months ago
AdaBoost with Totally Corrective Updates for Fast Face Detection
An extension of the AdaBoost learning algorithm is proposed and brought to bear on the face detection problem. In each weak classifier selection cycle, the novel totally correctiv...
Jan Sochman, Jiri Matas
EOR
2006
129views more  EOR 2006»
14 years 9 months ago
Balancing assembly lines with tabu search
Balancing assembly lines is a crucial task for manufacturing companies in order to improve productivity and minimize production costs. Despite some progress in exact methods to so...
Sophie D. Lapierre, Angel B. Ruiz, Patrick Soriano
CORR
2010
Springer
171views Education» more  CORR 2010»
14 years 8 months ago
Graphical Models Concepts in Compressed Sensing
This paper surveys recent work in applying ideas from graphical models and message passing algorithms to solve large scale regularized regression problems. In particular, the focu...
Andrea Montanari
WETICE
2005
IEEE
15 years 3 months ago
Entropy Based Worm and Anomaly Detection in Fast IP Networks
Detecting massive network events like worm outbreaks in fast IP networks, such as Internet backbones, is hard. One problem is that the amount of traffic data does not allow real-t...
Arno Wagner, Bernhard Plattner