433 search results - page 2 / 87 » Generalized Ham-Sandwich Cuts |
168
click to vote
ICPR
2008
IEEE
16 years 1 days ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
198
Voted
IOR
2011
15 years 17 days ago
2011
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
154
click to vote
ICCV
2005
IEEE
16 years 7 months ago
2005
IEEE
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...
353
Voted
CCO
2001
Springer
15 years 10 months ago
2001
Springer
In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on p...
174
Voted
EMMCVPR
2003
Springer
15 years 10 months ago
2003
Springer
Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are v...