2774 search results - page 36 / 555 » Exploiting Deep Structure |
LPAR
2010
Springer
14 years 10 months ago
2010
Springer
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
109
click to vote
TAMC
2010
Springer
14 years 10 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
ACL
2011
14 years 3 months ago
2011
CAISE
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Services are subject to constant change and variation. Services can evolve typically due to changes in structure, e.g., attributes and operations; in behavior and policie...
ACL
2010
14 years 9 months ago
2010
Tree-to-string translation rules are widely used in linguistically syntax-based statistical machine translation systems. In this paper, we propose to use deep syntactic informatio...