3653 search results - page 485 / 731 » On Recognizable Timed Languages |
165
click to vote
IFIP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
178
click to vote
IJCNLP
2004
Springer
15 years 12 months ago
2004
Springer
The snapshot of a word means the most informative fragment of the word. By taking the snapshot instead of the whole, the value space of the lexical feature can be significantly r...
157
click to vote
LCTRTS
2004
Springer
15 years 12 months ago
2004
Springer
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
182
click to vote
SOFSEM
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Research on processing XML documents gained much activity in recent times. XML query languages are mostly based on XPath expressions, which are used to select parts of XM...
154
click to vote
TSD
2004
Springer
15 years 12 months ago
2004
Springer
We investigate techniques for acoustic modeling in automatic recognition of context-independent phoneme strings from the TIMIT database. The baseline phoneme recognizer is based on...