656 search results - page 8 / 132 » Minimal non-convex words |
79
Voted
CDES
2006
14 years 11 months ago
2006
- Most of the direct-cover Boolean minimization techniques use a four step cyclic algorithm. First, the algorithm chooses an On-minterm; second, it generates the set of prime impli...
JUCS
2002
14 years 9 months ago
2002
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
ICDAR
2009
IEEE
14 years 7 months ago
2009
IEEE
Hybrid of Neural Network (NN) and Hidden Markov Model (HMM) has been popular in word recognition, taking advantage of NN discriminative property and HMM representational capabilit...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
: We deal in this paper with strategical languages of infinite words, that is those generated by a nondeterministic strategy in the sense of game theory. We first show the existenc...
ICDAR
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper a methodology for feature selection in unsupervised learning is proposed. It makes use of a multiobjective genetic algorithm where the minimization of the number of ...