4095 search results - page 33 / 819 » How to test a tree |
AUIC
2006
IEEE
14 years 1 months ago
2006
IEEE
• This paper describes techniques for visualising pairs of similar trees. Our aim is to develop ways of presenting the information so as to highlight both the common structure of...
PKDD
2005
Springer
14 years 1 months ago
2005
Springer
Cost-sensitive decision tree and cost-sensitive naïve Bayes are both new cost-sensitive learning models proposed recently to minimize the total cost of test and misclassifications...
SFP
2001
13 years 9 months ago
2001
We describe the design and implementation of a Standard ML of New Jersey library for the interactive pretty-printing of possibly infinite syntax trees. The library handles elision ...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
JOBIM
2000
13 years 11 months ago
2000
Abstract. A tree representation distance method, applied to any dissimilarity array, always gives a valued tree, even if the tree model is not appropriate. In the first part, we pr...