Sciweavers

187 search results - page 6 / 38
» Labeling Schemes for Tree Representation
Sort
View
LICS
2010
IEEE
13 years 5 months ago
Recursion Schemes and Logical Reflection
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
Christopher H. Broadbent, Arnaud Carayol, C.-H. Lu...
DEXAW
2007
IEEE
92views Database» more  DEXAW 2007»
14 years 2 months ago
Subtree Testing and Closed Tree Mining Through Natural Representations
Several classical schemes exist to represent trees as strings over a fixed alphabet; these are useful in many algorithmic and conceptual studies. Our previous work has proposed a...
José L. Balcázar, Albert Bifet, Anto...
LREC
2010
191views Education» more  LREC 2010»
13 years 9 months ago
Spatial Role Labeling: Task Definition and Annotation Scheme
One of the essential functions of natural language is to talk about spatial relationships between objects. Linguistic constructs can express highly complex, relational structures ...
Parisa KordJamshidi, Martijn van Otterlo, Marie-Fr...
PPSN
1994
Springer
13 years 12 months ago
A Representation Scheme To Perform Program Induction in a Canonical Genetic Algorithm
This paper studies Genetic Programming (GP) and its relation to the Genetic Algorithm (GA). GP uses a GA approach to breed successive populations of programs, represented in the ch...
Mark Wineberg, Franz Oppacher
ACL
2001
13 years 9 months ago
Parse Forest Computation of Expected Governors
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. This labeling is a summary of a syntactic analysis which eliminates de...
Helmut Schmid, Mats Rooth