Sciweavers

396 search results - page 7 / 80
» Factor Automata of Automata and Applications
Sort
View
AUSAI
2003
Springer
15 years 5 months ago
Reduction of Non Deterministic Automata for Hidden Markov Model Based Pattern Recognition Applications
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...
Frédéric Maire, Frank Wathne, Alain ...
ICIAP
1999
ACM
15 years 4 months ago
Cellular Automata Based Optical Flow Computation for "Just-in-Time" Applications
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...
Giovanni Adorni, Stefano Cagnoni, Monica Mordonini
DBSEC
2010
129views Database» more  DBSEC 2010»
15 years 1 months ago
Secure Outsourcing of DNA Searching via Finite Automata
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...
Marina Blanton, Mehrdad Aliasgari
ICALP
2010
Springer
15 years 1 months ago
Efficient Evaluation of Nondeterministic Automata Using Factorization Forests
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
Mikolaj Bojanczyk, Pawel Parys
HIS
2004
15 years 1 months ago
A Case-Based Recommender for Task Assignment in Heterogeneous Computing Systems
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...
S. Ghanbari, Mohammad Reza Meybodi, Kambiz Badie