500 search results - page 31 / 100 » Streaming tree automata |
AUSAI
2003
Springer
14 years 26 days ago
2003
Springer
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...
DLT
2003
13 years 9 months ago
2003
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
STACS
2009
Springer
14 years 5 days ago
2009
Springer
ABSTRACT. This paper gives a brief overview of computation models for data stream processing, and it introduces a new model for multi-pass processing of multiple streams, the so-ca...
LICS
2010
IEEE
13 years 5 months ago
2010
IEEE
We develop the theory of regular cost functions over finite trees: a quantitative extension to the notion of regular languages of trees: Cost functions map each input (tree) to a v...
DSN
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper addresses the problem of fault resilience of overlay-based live media streaming from two aspects: (1) how to construct a stable multicast tree that minimizes the negati...