50 search results - page 9 / 10 » Lagrange Multiplier Method for Multi-campaign Assignment Pro... |
ATAL
2009
Springer
14 years 25 days ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
CSCLP
2006
Springer
13 years 10 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
SIAMJO
2010
13 years 4 months ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
CVPR
1998
IEEE
14 years 8 months ago
1998
IEEE
In this paper we present a method for the integration of nonlinear holonomic constraints in deformable models and its application to the problems of shape and illuminant direction...
CVPR
2012
IEEE
11 years 8 months ago
2012
IEEE
We address the problem of multi-person dataassociation-based tracking (DAT) in semi-crowded environments from a single camera. Existing trackletassociation-based methods using pur...