720 search results - page 62 / 144 » Linear k-arboricities on trees |
ICDE
2004
IEEE
14 years 10 months ago
2004
IEEE
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
WADS
1997
Springer
14 years 26 days ago
1997
Springer
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set ...
ENTCS
2000
13 years 8 months ago
2000
The coincidence between the model-theoretic and the procedural semantics of SLDresolution does not carry over to a Prolog system that also implements non-logical features like cut...
ICDAR
2009
IEEE
13 years 6 months ago
2009
IEEE
This paper proposes a syntactic method for detection and correction of misrecognized mathematical formulae for a practical mathematical OCR system. Linear monadic context-free tre...