720 search results - page 1 / 144 » Linear k-arboricities on trees |
ACL
2001
13 years 6 months ago
2001
We describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutua...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
LATIN
1995
Springer
13 years 8 months ago
1995
Springer
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
IANDC
2008
13 years 4 months ago
2008
Abstract. Unfortunately the class of transformations computed by nondeleting and linear extended top-down tree transducers [Graehl, Knight: Training Tree Transducers. HLT-NAACL 200...
ACISICIS
2005
IEEE
13 years 6 months ago
2005
IEEE
This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation i...