Choice set generation for iterated DTA simulations
Publications associées (32)
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Markov chain Monte Carlo has been the standard technique for inferring the posterior distribution of genome rearrangement scenarios under a Bayesian approach. We present here a negative result on the rate of convergence of the generally used Markov chains. ...
In this paper, we propose a Markov chain modeling of complicated phenomena observed from coupled chaotic oscillators. Once we obtain the transition probability matrix from computer simulation results, various statistical quantities can be easily calculated ...
We suggest a continuous-domain stochastic modeling of images that is invariant to spatial resolution. Specifically, we are proposing an estimator that is calibrated with respect to the sampling step, and that can potentially handle aliased data. Motivated ...
We suggest a continuous-domain stochastic modeling of images that is invariant to spatial resolution. Specifically, we are proposing an estimator that is calibrated with respect to the sampling step, and that can potentially handle aliased data. Motivated ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011
In this paper, we study deterministic limits of Markov processes having discontinuous drifts. While most results assume that the limiting dynamics is continuous, we show that these conditions are not necessary to prove convergence to a deterministic system ...
To quantify the randomness of Markov trajectories with fixed initial and final states, Ekroot and Cover proposed a closed-form expression for the entropy of trajectories of an irreducible finite state Markov chain. Numerous applications, including the stud ...
We propose a method for accurate and temporally consistent surface classification in the presence of noisy, irregularly sampled measurements, and apply it to the estimation of snow coverage over time. The input imagery is extremely challenging, with large ...
Mobility is a central aspect of our life, and our movements reveal much more about us than simply our whereabouts. In this thesis, we are interested in mobility and study it from three different perspectives: the modeling perspective, the information-theor ...
To improve visual tracking, a large number of papers study more powerful features, or better cue fusion mechanisms, such as adaptation or contextual models. A complementary approach consists of improving the track management, that is, deciding when to add ...
In this paper, we discuss a novel method for channel estimation. The approach is based on the idea of modeling the complex channel gains by a Markov random field. This graphical model is used to capture the statistical dependencies between consecutive taps ...