Sciweavers

4524 search results - page 38 / 905
» The Complexity of Global Constraints
Sort
View
125
Voted
FOCS
2008
IEEE
15 years 1 months ago
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
Siu On Chan, Michael Molloy
116
Voted
JACM
2010
116views more  JACM 2010»
14 years 11 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
88
Voted
EMNLP
2008
15 years 1 months ago
Jointly Combining Implicit Constraints Improves Temporal Ordering
Previous work on ordering events in text has typically focused on local pairwise decisions, ignoring globally inconsistent labels. However, temporal ordering is the type of domain...
Nathanael Chambers, Daniel Jurafsky
141
Voted
CVPR
2001
IEEE
16 years 2 months ago
Combining Two-view Constraints For Motion Estimation
In this paper we describe two methods for estimating the motion parameters of an image sequence. For a sequence of images, the global motion can be described by ???? independent m...
Venu Madhav Govindu
SIAMCOMP
2008
100views more  SIAMCOMP 2008»
15 years 11 days ago
On the Complexity of Verifying Consistency of XML Specifications
XML specifications often consist of a type definition (typically, a DTD) and a set of integrity constraints. It has been shown previously that such specifications can be inconsiste...
Marcelo Arenas, Wenfei Fan, Leonid Libkin