396 search results - page 7 / 80 » Factor Automata of Automata and Applications |
92
Voted
AUSAI
2003
Springer
15 years 3 months 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...
124
Voted
ICIAP
1999
ACM
15 years 2 months ago
1999
ACM
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...
84
Voted
DBSEC
2010
14 years 11 months ago
2010
This work treats the problem of error-resilient DNA searching via oblivious evaluation of finite automata, formulated as follows: a client has a DNA sequence, and a service provid...
74
Voted
ICALP
2010
Springer
15 years 7 days ago
2010
Springer
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
96
Voted
HIS
2004
14 years 11 months ago
2004
Case-based reasoning (CBR) is a knowledge-based problem-solving technique, which is based on reuse of previous experiences. In this paper we propose a new model for static task as...