843 search results - page 88 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
AIPS
2003
15 years 2 months ago
2003
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
BIOINFORMATICS
2007
15 years 1 months ago
2007
Primer approximation multiplex PCR (PAMP) is a new experimental protocol for efficiently assaying structural variation in genomes. PAMP is particularly suited to cancer genomes w...
116
click to vote
ICRA
2006
IEEE
15 years 7 months ago
2006
IEEE
— We address the problem of placing a sensor network so as to minimize the uncertainty in estimating the position of targets. The novelty of our formulation is in the sensing mod...
107
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
110
click to vote
WADS
2005
Springer
15 years 7 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...