773 search results - page 48 / 155 » Suffix Trees on Words |
198
click to vote
ACL
1996
15 years 7 months ago
1996
We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for increment...
165
click to vote
IJAC
2007
15 years 6 months ago
2007
Abstract. Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to tra...
191
click to vote
ISAAC
2009
Springer
16 years 22 days ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
184
click to vote
ECML
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Ensemble methods are popular learning methods that usually increase the predictive accuracy of a classifier though at the cost of interpretability and insight in the deci...
166
click to vote
NJC
2000
15 years 6 months ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...