356 search results - page 36 / 72 » On the Global Solution of Linear Programs with Linear Comple... |
PADL
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. Mathematical programs (MPs) are a class of constrained optimization problems that include linear, mixed-integer, and disjunctive programs. Strategies for solving MPs rely...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
User-provided object bounding box is a simple and
popular interaction paradigm considered by many existing
interactive image segmentation frameworks. However,
these frameworks t...
CORR
2002
Springer
13 years 8 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
We propose a new scheme to estimate image bias field through introducing two sparsity constraints. One is that the bias-free image has concise representation with image gradients o...
ESA
2006
Springer
14 years 12 days ago
2006
Springer
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...