331 search results - page 21 / 67 » Using Redundant Constraints for Refinement |
97
Voted
EMNLP
2010
15 years 17 days ago
2010
We present an approach to grammar induction that utilizes syntactic universals to improve dependency parsing across a range of languages. Our method uses a single set of manually-...
107
Voted
AI
2006
Springer
15 years 2 months ago
2006
Springer
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
132
Voted
JCS
2010
14 years 9 months ago
2010
We introduce constraint differentiation, a powerful technique for reducing search when model-checking security protocols using constraint-based methods. Constraint differentiation...
129
Voted
DKE
2008
15 years 2 months ago
2008
In this paper, we discuss a novel technique based on semantic constraints to improve the performance and portability of a reformulation-based question answering system. First, we ...
124
click to vote
SIGMOD
2008
ACM
15 years 2 months ago
2008
ACM
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...