21 search results - page 1 / 5 » Parameter Reduction in Grammar-Compressed Trees |
FOSSACS
2009
Springer
14 years 2 days 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...
TCBB
2010
13 years 3 months ago
2010
We show that subtree prune and regraft (uSPR) distance on unrooted trees is fixed parameter tractable with respect to the distance. We also make progress on a conjecture of Steel...
INFORMATICALT
2008
13 years 4 months ago
2008
Classification and regression tree approach was used in this research to model phone duration of Lithuanian. 300 thousand samples of vowels and 400 thousand samples of consonants e...
CIAC
2006
Springer
13 years 9 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
3DOR
2009
13 years 3 months ago
2009
Terrestrial laser scanners capture 3D geometry as a point cloud. This paper reports on a new algorithm aiming at the skeletonisation of a laser scanner point cloud, representing a...