2467 search results - page 174 / 494 » Finite State Machines |
210
click to vote
COLT
1998
Springer
15 years 10 months ago
1998
Springer
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...
172
click to vote
APIN
1999
15 years 6 months ago
1999
We present a method for mapping a given Bayesian network to a Boltzmann machine architecture, in the sense that the the updating process of the resulting Boltzmann machine model pr...
173
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
In the Weighted Finite State Transducer (WFST) framework for speech recognition, we can reduce memory usage and increase flexibility by using on-the-fly composition which genera...
159
click to vote
FMICS
2007
Springer
15 years 10 months ago
2007
Springer
Due to the significant progress in automated verification, there are often several techniques for a particular verification problem. In many circumstances different techniques are ...
187
click to vote
FOIKS
2008
Springer
15 years 8 months ago
2008
Springer
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model stat...