Sciweavers

664 search results - page 27 / 133
» The tree Constraint
Sort
View
CSCLP
2004
Springer
14 years 28 days ago
New Structural Decomposition Techniques for Constraint Satisfaction Problems
We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques both theoretically and experimentally with hinge deco...
Yaling Zheng, Berthe Y. Choueiry
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
Maximum Entropy Rate of Markov Sources for Systems With Non-regular Constraints
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...
Georg Böcherer, Valdemar Cardoso da Rocha Jr....
CL
2000
Springer
13 years 12 months ago
Dominance Constraints with Set Operators
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
Denys Duchier, Joachim Niehren
ACL
1994
13 years 8 months ago
Multiset-Valued Linear Index Grammars: Imposing Dominance Constraints on Derivations
This paper defines multiset-valued linear index grammar and unordered vector grammar with dominance links. The former models certain uses of multisetvalued feature structures in u...
Owen Rambow
ACL
1990
13 years 8 months ago
Structural Disambiguation with Constraint Propagation
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
Hiroshi Maruyama