7259 search results - page 78 / 1452 » From Fields to Trees |
181
click to vote
IDEAL
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Tree edit distance is a conventional dissimilarity measure between labeled trees. However, tree edit distance including unit-cost edit distance contains the similarity of...
183
click to vote
ISCIS
2009
Springer
15 years 11 months ago
2009
Springer
—We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree wi...
188
click to vote
AAAI
2007
15 years 9 months ago
2007
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
218
click to vote
IPCV
2008
15 years 8 months ago
2008
Minimum spanning tree algorithms have been proposed for the lossy compression of image sets. In these algorithms, a complete graph is constructed from the entire image set and an ...
259
click to vote
DCC
2011
IEEE
15 years 1 months ago
2011
IEEE
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...