Sciweavers

570 search results - page 5 / 114
» The Complexity of Reasoning with Global Constraints
Sort
View
CVPR
2006
IEEE
14 years 5 months ago
Measure Locally, Reason Globally: Occlusion-sensitive Articulated Pose Estimation
Part-based tree-structured models have been widely used for 2D articulated human pose-estimation. These approaches admit efficient inference algorithms while capturing the import...
Leonid Sigal, Michael J. Black
LICS
2010
IEEE
13 years 9 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...
ICLP
1993
Springer
14 years 3 months ago
A Minimal Extension of the WAM for clp(FD)
nt an abstract instruction set for a constraint solver over finite domains, which can be smoothly integrated in the WAM architecture. It is based on the use of a single primitive...
Daniel Diaz, Philippe Codognet
TIME
2002
IEEE
14 years 3 months ago
Representation and Reasoning with Disjunctive Temporal Constraints
We show the expressiveness provided by a Labelled point-based metric model for specifying and reasoning about complex disjunctive temporal constraints. The model allows us to mana...
María Isabel Alfonso Galipienso, Federico B...
CP
2008
Springer
14 years 20 days ago
A Soft Constraint of Equality: Complexity and Approximability
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon