Sciweavers

664 search results - page 29 / 133
» The tree Constraint
Sort
View
ACL
1998
13 years 10 months ago
Parsing Ambiguous Structures using Controlled Disjunctions and Unary Quasi-Trees
The problem of parsing ambiguous structures concerns (i) their representation and (ii) the specification of mechanisms allowing to delay and control their evaluation. We first pro...
Philippe Blache
TASLP
2008
134views more  TASLP 2008»
13 years 8 months ago
Semantic Role Labeling Using a Grammar-Driven Convolution Tree Kernel
Convolution tree kernel has shown promising results in semantic role labeling (SRL). However, this kernel does not consider much linguistic knowledge in kernel design and only perf...
Min Zhang, Wanxiang Che, Guodong Zhou, AiTi Aw, Ch...
CP
2008
Springer
13 years 10 months ago
Perfect Constraints Are Tractable
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. Thes...
András Z. Salamon, Peter G. Jeavons
ECML
2007
Springer
14 years 2 months ago
Learning Metrics Between Tree Structured Data: Application to Image Recognition
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
Laurent Boyer 0002, Amaury Habrard, Marc Sebban
CP
2007
Springer
14 years 2 months ago
Encodings of the Sequence Constraint
Abstract. The SEQUENCE constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the SEQUENCE constra...
Sebastian Brand, Nina Narodytska, Claude-Guy Quimp...