3818 search results - page 136 / 764 » Word Problems on Compressed Words |
146
click to vote
IPL
2002
15 years 4 months ago
2002
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
146
click to vote
TALG
2010
15 years 3 months ago
2010
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
209
click to vote
CPM
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
160
click to vote
CAIP
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we propose a new manifold representation capable of being applied for visual speech recognition. In this regard, the real time input video data is compressed using P...
125
Voted
SPIRE
1998
Springer
15 years 9 months ago
1998
Springer
Stemming is a technique which aims to extract common suffixes of words. Thus, words which are literally differhave a common stem, may be abstracted by their common stem. The under...