Sciweavers

664 search results - page 61 / 133
» The tree Constraint
Sort
View
SAS
1999
Springer
13 years 12 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller
CVPR
2010
IEEE
14 years 1 months ago
Variational Segmentation of Elongated Volumetric Structures
We present an interactive approach for segmenting thin volumetric structures. The proposed segmentation model is based on an anisotropic weighted Total Variation energy with a glo...
Christian Reinbacher, Thomas Pock, Christian Bauer...
COLING
1992
13 years 8 months ago
Modularity, Parallelism, And Licensing In A Principle-Based Parser For German
This paper presents a direct implementation of Government-Binding theory in a parser for German, which faithfully models the modular structure of the theory. The modular design yi...
Sebastian Millies
ACL
1990
13 years 8 months ago
Lexical and Syntactic Rules in a Tree Adjoining Grammar
according to this definition2. Each elementary tree is constrained to have at least one terminal at its frontier which serves as 'head' (or 'anchor'). Sentence...
Anne Abeillé
PODS
2006
ACM
98views Database» more  PODS 2006»
14 years 7 months ago
Two-variable logic on data trees and XML reasoning
d Abstract] Mikolaj Boja?nczyk Faculty of Mathematics, Informatics and Mechanics Warsaw University Poland Claire David LIAFA Universit?e Paris 7 France Anca Muscholl LIAFA Universi...
Mikolaj Bojanczyk, Claire David, Anca Muscholl, Th...