3818 search results - page 8 / 764 » Word Problems on Compressed Words |
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Let S be a finite set of words such that Fact(S ) = . We deal with the problem of finding bounds on the minimal length of words in \ Fact(S ) in terms of the maximal length of wor...
CPM
2006
Springer
15 years 1 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 ...
103
click to vote
FLAIRS
2009
14 years 7 months ago
2009
This paper describes a novel application of text categorization for mathematical word problems, namely Multiplicative Compare and Equal Group problems. The empirical results and a...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
GCB
2000
Springer
15 years 1 months ago
2000
Springer
In previous work [10], we considered algorithms related to the statistics of matches with words and regular expressions in texts generated by Bernoulli or Markov sources. In this w...