405 search results - page 27 / 81 » On the Complexity of Global Constraint Satisfaction |
102
click to vote
ICCV
2011
IEEE
13 years 11 months ago
2011
IEEE
In this paper, we show that tracking multiple people whose paths may intersect can be formulated as a convex global optimization problem. Our proposed framework is designed to exp...
STACS
2005
Springer
15 years 4 months ago
2005
Springer
ded abstract of this article is published in the proceedings of STACS’05, LNCS 3404, Springer Verlag. A relational structure is a core, if all its endomorphisms are embeddings. T...
120
click to vote
CP
2007
Springer
15 years 5 months ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
HICSS
2003
IEEE
15 years 4 months ago
2003
IEEE
Global software development projects use virtual teams, which are primarily linked through computer and telecommunications technologies across national boundaries. Global Virtual ...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...