Displaying similar documents to “Probabilistic models for pattern statistics”

A mathematical framework for learning and adaption: (generalized) random systems with complete connections.

Ulrich Herkenrath, Radu Theodorescu (1981)

Trabajos de Estadística e Investigación Operativa

Similarity:

The aim of this paper is to show that the theory of (generalized) random systems with complete connection may serve as a mathematical framework for learning and adaption. Chapter 1 is of an introductory nature and gives a general description of the problems with which one is faced. In Chapter 2 the mathematical model and some results about it are explained. Chapter 3 deals with special learning and adaption models.

Pipelined language model construction for Polish speech recognition

Jerzy Sas, Andrzej Żołnierek (2013)

International Journal of Applied Mathematics and Computer Science

Similarity:

The aim of works described in this article is to elaborate and experimentally evaluate a consistent method of Language Model (LM) construction for the sake of Polish speech recognition. In the proposed method we tried to take into account the features and specific problems experienced in practical applications of speech recognition in the Polish language, reach inflection, a loose word order and the tendency for short word deletion. The LM is created in five stages. Each successive stage...

Fast simulation for road traffic network

Roberta Jungblut-Hessel, Brigitte Plateau, William J. Stewart, Bernard Ycart (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper we present a method to perform fast simulation of large markovian systems. This method is based on the use of three concepts: Markov chain uniformization, event-driven dynamics, and modularity. An application of urban traffic simulation is presented to illustrate the performance of our approach.

On a class of linear models.

Radu Theodorescu (1985)

Trabajos de Estadística e Investigación Operativa

Similarity:

This paper is concerned with classification criteria, asymptotic behaviour and stationarity of a non-Markovian model with linear transition rule, called a linear OM-chain. This problems are solved by making use of the structure of the stochastic matrix appearing in the definition of such a model. The model studied includes as special cases the Markovian model as well as the linear learning model, and has applications in psychological and biological research, in control theory, and in...

A Markov chain model for traffic equilibrium problems

Giandomenico Mastroeni (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

We consider a stochastic approach in order to define an equilibrium model for a traffic-network problem. In particular, we assume a markovian behaviour of the users in their movements throughout the zones of the traffic area. This assumption turns out to be effective at least in the context of urban traffic, where, in general, the users tend to travel by choosing the path they find more convenient and not necessarily depending on the already travelled part. The developed model is a homogeneous...

Transducing by observing length-reducing and painter rules

Norbert Hundeshagen, Peter Leupold (2014)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

The recently introduced model of transducing by observing is compared with traditional models for computing transductions on the one hand and the recently introduced restarting transducers on the other hand. Most noteworthy, transducing observer systems with length-reducing rules are almost equivalent to RRWW-transducers. With painter rules we obtain a larger class of relations that additionally includes nearly all rational relations.