Sciweavers

4118 search results - page 594 / 824
» Efficient Algorithms for Airline Problem
Sort
View
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
15 years 2 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...
CVPR
2009
IEEE
16 years 11 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...
ICCV
2009
IEEE
16 years 9 months ago
Extending Continuous Cuts: Anisotropic Metrics and Expansion Moves
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...
Carl Olsson, Martin Byr¨od, Niels Chr. Overgaard,...
CVPR
2001
IEEE
16 years 6 months ago
Generic Model Abstraction from Examples
Model Abstraction from Examples Yakov Keselman, Member, IEEE, and Sven Dickinson, Member, IEEE The recognition community has typically avoided bridging the representational gap bet...
Yakov Keselman, Sven J. Dickinson
CVPR
2003
IEEE
16 years 6 months ago
Constrained Subspace Modelling
When performing subspace modelling of data using Principal Component Analysis (PCA) it may be desirable to constrain certain directions to be more meaningful in the context of the...
Jaco Vermaak, Patrick Pérez