16430 search results - page 134 / 3286 » On Computable Tree Functions |
135
click to vote
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
We show how the understandability and speed of genetic programming classification algorithms can be improved, without affecting the classification accuracy. By analyzing the dec...
108
click to vote
VMV
2008
15 years 5 months ago
2008
In computer graphics, procedural methods and Lsystems are common approaches to model complex botanical trees. In contrast to previous tree modeling systems, we propose linking rul...
112
Voted
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We consider the Edit distance with moves on the class of words and the class of ordered trees. We first exhibit a simple tester for the class of regular languages on words and gen...
153
Voted
SODA
2003
ACM
15 years 4 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
114
Voted
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
y trees are well-known abstract structures. This paper proposes a new shape-based image retrieval method based on concavity trees. The proposed method has two main components. The...