In L. Hunter, ed. Proc. 27th Hawaii Intl. Conf. on System Sciences V: 316-325. C. Williams and G. E. Hinton. (1990) Mean field networks that learn to discriminate temporally distorted strings. Proc. Connectionist Models Summer School: 18--22.  Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Exploiting Tractable Substructures in Intractable Networks - Saul, Jordan (1995) (47 citations) (Correct)
....(Rabiner Juang, 1991) The first order probabilistic structure of hidden Markov models (HMMs) leads to networks with chained architectures for which efficient, exact algorithms are available. More elaborate networks are obtained by introducing couplings between multiple HMMs (Williams Hinton, 1990) and or long range couplings within a single HMM (Stolorz, 1994) Both sorts of extensions have interesting applications; in speech, for example, multiple HMMs can provide a distributed representation of the articulatory state, while long range couplings can model the effects of coarticulation. In ....
In L. Hunter, ed. Proc. 27th Hawaii Intl. Conf. on System Sciences V: 316-325. C. Williams and G. E. Hinton. (1990) Mean field networks that learn to discriminate temporally distorted strings. Proc. Connectionist Models Summer School: 18--22.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC