21 search results - page 3 / 5 » On-Line Linear-Time Construction of Word Suffix Trees |
107
click to vote
WADS
2007
Springer
15 years 3 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
ACL
2009
14 years 7 months ago
2009
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...
ALGORITHMICA
2008
14 years 9 months ago
2008
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
69
Voted
SIAMCOMP
1998
14 years 9 months ago
1998
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
KDD
2006
ACM
15 years 9 months ago
2006
ACM
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...