357 search results - page 9 / 72 » Solving Generalized Maximum Dispersion with Linear Programmi... |
ICCV
1998
IEEE
13 years 12 months ago
1998
IEEE
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
WSC
2008
13 years 10 months ago
2008
In this paper, we suggest a linear programming formulation that allows for solving volume and capacity planning problems in semiconductor manufacturing systems. We assume a genera...
CVPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Segmenting arbitrary unions of linear subspaces is an important tool for computer vision tasks such as motion and image segmentation, SfM or object recognition. We segment subspac...
COLOGNETWENTE
2009
13 years 8 months ago
2009
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...