4524 search results - page 103 / 905 » The Complexity of Global Constraints |
101
click to vote
CISSE
2009
Springer
15 years 4 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
AMW
2010
15 years 2 months ago
2010
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) a...
77
Voted
MICCAI
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We show that a simple probabilistic modelling of the registration problem for surfaces allows to solve it by using standard clustering techniques. In this framework, poin...
100
Voted
ACL
2006
15 years 2 months ago
2006
The ability to compress sentences while preserving their grammaticality and most of their meaning has recently received much attention. Our work views sentence compression as an o...
71
Voted
IJCAI
1989
15 years 1 months ago
1989
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...