592 search results - page 13 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
ICCV
1998
IEEE
15 years 1 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 ...
MP
2007
14 years 9 months ago
2007
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequency-division mult...
92
Voted
ACML
2009
Springer
15 years 1 months ago
2009
Springer
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
83
Voted
VMCAI
2007
Springer
15 years 3 months ago
2007
Springer
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good...