570 search results - page 8 / 114 » The Complexity of Reasoning with Global Constraints |
ICCV
2011
IEEE
13 years 9 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...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...
IJCAI
1997
14 years 11 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
PODS
2007
ACM
15 years 9 months ago
2007
ACM
XML and semi-structured data are now de-facto standards for data exchange, and it is often the case that published or exchanged XML documents have specic restrictions on how they ...
70
Voted
FLAIRS
2008
14 years 12 months ago
2008
Reasoning with conditional time-intervals representing activities or tasks that may or may not be executed in the final schedule is crucial in many scheduling applications. In Con...