187 search results - page 10 / 38 » Labeling Schemes for Tree Representation |
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
SIGGRAPH
1999
ACM
14 years 4 days ago
1999
ACM
Using multiple reference images in 3D image warping has been a challenging problem. Recently, the Layered Depth Image (LDI) was proposed by Shade et al. to merge multiple referenc...
IDA
2000
Springer
13 years 7 months ago
2000
Springer
Conventional algorithms for decision tree induction use an attribute-value representation scheme for instances. This paper explores the empirical consequences of using set-valued ...
ICDE
2006
IEEE
14 years 1 months ago
2006
IEEE
It is important to process the updates when nodes are inserted into or deleted from the XML tree. All the existing labeling schemes have high update cost, thus in this paper we pr...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...