393 search results - page 47 / 79 » Convex Programming Methods for Global Optimization |
ICCV
2009
IEEE
15 years 17 days ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
CEC
2010
IEEE
13 years 6 months ago
2010
IEEE
— This work investigates the effects of the periodization of local and global multi-objective search algorithms. To this, we introduce a model for periodization and define a new...
ISQED
2008
IEEE
14 years 2 months ago
2008
IEEE
—Power and energy consumption has emerged as the premier and most constraining aspect in modern computational systems. Dynamic Voltage Scheduling (DVS) has been provably one of t...
CVPR
2007
IEEE
14 years 1 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
ASPDAC
1999
ACM
13 years 12 months ago
1999
ACM
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placeme...