20 search results - page 2 / 4 » Continuous reformulations of discrete-continuous optimizatio... |
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
CCO
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
CP
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
ICCV
2009
IEEE
14 years 10 months 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...
ICDE
2012
IEEE
11 years 8 months ago
2012
IEEE
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...