Sciweavers

511 search results - page 26 / 103
» Using Combinatorial Optimization Methods for Quantification ...
Sort
View
ICCV
2011
IEEE
13 years 9 months ago
Optimal Landmark Detection using Shape Models and Branch and Bound
Fitting statistical 2D and 3D shape models to images is necessary for a variety of tasks, such as video editing and face recognition. Much progress has been made on local fitting...
Brian Amberg, Thomas Vetter
WSC
2008
14 years 12 months ago
Simulation-based, optimized scheduling of limited bar-benders over multiple building sites
In the construction industry, a specialist subcontractor manages a taskforce of single-skilled laborers to work on multiple construction sites, aiming to minimize the total cost a...
Hoi-Ching Lam, Ming Lu
104
Voted
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
14 years 9 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
78
Voted
ML
2002
ACM
128views Machine Learning» more  ML 2002»
14 years 9 months ago
A Simple Method for Generating Additive Clustering Models with Limited Complexity
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...
Michael D. Lee
IPCO
2008
221views Optimization» more  IPCO 2008»
14 years 11 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...