36 search results - page 7 / 8 » Labeling trees with a condition at distance two |
WABI
2010
Springer
13 years 4 months ago
2010
Springer
Although many supertree methods have been developed in the last few decades, none has been shown to produce more accurate trees than the popular Matrix Representation with Parsimon...
DOCENG
2003
ACM
13 years 11 months ago
2003
ACM
This paper describes an implementation for syntax-directed transformation of XML documents from one structure to another. The system is based on the method which we have introduce...
DAM
2008
13 years 5 months ago
2008
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...
ISMIR
2005
Springer
13 years 11 months ago
2005
Springer
A system that segments and labels tabla strokes from real performances is described. Performance is evaluated on a large database taken from three performers under different recor...
SIAMJO
2008
13 years 5 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....