139 search results - page 9 / 28 » Improved Algorithms for the Global Cardinality Constraint |
128
click to vote
SIAMJO
2000
15 years 1 months ago
2000
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
116
click to vote
CVPR
2008
IEEE
15 years 7 months ago
2008
IEEE
We propose a network flow based optimization method for data association needed for multiple object tracking. The maximum-a-posteriori (MAP) data association problem is mapped in...
125
click to vote
DAC
2003
ACM
15 years 6 months ago
2003
ACM
This paper describes a new force directed global placement algorithm that exploits and extends techniques from two leading placers, Force-directed [12] [26] and Mongrel [22]. It c...
ICCV
2003
IEEE
16 years 3 months ago
2003
IEEE
Inspired by tensor voting, we present luminance voting, a novel approach for image registration with global and local luminance alignment. The key to our modeless approach is the ...
IJCAI
2001
15 years 2 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...