Markov chain modeling of chaotic wandering in simple coupled chaotic circuits
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This paper describes a procedure based on the Monte Carlo method to obtain the statistical distributions of lightning current parameters at ground level starting from those inferred from experimental data recorded by means of tall instrumented towers. As a ...
This paper compares the performance of seven disaggregation models, based on various approaches and/or concepts, for the generation of 10mn time step rainfall series from hourly rainfall series. The so-called constant disaggregation model and a linear mode ...
In this paper, the design of probabilistic observers for mass-balance based bioprocess models is investigated. It is assumed that the probability density of every uncertain parameter, input and/or initial state is known a priori. Then, the probability dens ...
In this paper we propose a method to segment and recognize text embedded in video and images. We modelize the gray level distribution in the text images as mixture of gaussians, and then assign each pixel to one of the gaussian layer. The assignment is bas ...
We explore the scheduling rules and the hedging levels that can be obtained by using a restless bandit problem formulation of a make-to-stock production. The underlying dynamics are a Markov chain in continuous time and the associated rewards are piecewise ...
Content storage in a distributed collaborative environment uses redundancy for better resilience and thus provides good availability and durability. In a peer-to-peer environment, where peers continuously leave and rejoin the network, various lazy strategi ...
This paper introduces and motivates the use of Gaussian Mixture Models (GMMs) for on-line signature verification. The individual Gaussian components are shown to represent some local, signer-dependent features that characterise spatial and temporal aspects ...
We explore the scheduling rules and the hedging levels that can be obtained by using a Restless Bandit Problem formulation of a make-to-stock production. The underlying dynamics are markov chain in continuous lime and the associate reward are piecewise lin ...
In this paper we propose a method to segment and recognize text embedded in video and images. We modelize the gray level distribution in the text images as mixture of gaussians, and then assign each pixel to one of the gaussian layer. The assignment is bas ...
In this article we discuss Markovian term structure models in discrete time and with continuous state space. More precisely we are concerned with the structural properties of such models if one has the Markov property for a part of the forward curve. We in ...
