1343 search results - page 26 / 269 » Learning Weighted Automata |
STACS
2004
Springer
14 years 3 months ago
2004
Springer
d Abstract)⋆⋆ Daniel Kirsten LIAFA, Universit´e Denis Diderot – Case 7014, 2 place Jussieu, F-75251 Paris Cedex 05, France We give a positive solution to the so-called fini...
CONCUR
2006
Springer
14 years 1 months ago
2006
Springer
Working in the context of a process-algebraic language for Probabilistic I/O Automata (PIOA), we study the notion of PIOA behavior equivalence by obtaining a complete axiomatizatio...
CSL
2002
Springer
13 years 9 months ago
2002
Springer
We survey the use of weighted finite-state transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for HMM models, context-depend...
DKE
2006
13 years 10 months ago
2006
Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
ICANN
1997
Springer
14 years 2 months ago
1997
Springer
: We present the implementation of on-line Hebbian learning for NESPINN, the Neurocomputer for the simulation of spiking neurons. In order to support various forms of Hebbian learn...