Multigrid Methods Combined With Low-Rank Approximation For Tensor-Structured Markov Chains
Related publications (46)
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.
We present a simple, effective generalisation of variable order Markov models to full online Bayesian estimation. The mechanism used is close to that employed in context tree weighting. The main contribution is the addition of a prior, conditioned on conte ...
We present an approach based on Hidden Markov Model (HMM) and Gaussian Mixture Regression (GMR) to learn robust models of human motion through imitation. The proposed approach allows us to extract redundancies across multiple demonstrations and build time- ...
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 present a comprehensive framework for stochastic modeling, model abstraction, and controller design for a biological system. The first half of the paper concerns modeling and model abstraction of the system. Most models in systems biology ...
Institute of Electrical and Electronics Engineers2008
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 ...
We present ail on-the-fly abstraction technique for infinite-state continuous-time Markov chains. We consider Markov chains that are specified by a finite set of transition classes. Such models naturally represent biochemical reactions and therefore play a ...
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009
Abstraction techniques based on simulation relations have become an important and effective proof technique to avoid the infamous state space explosion problem. In the context of Markov chains, strong and weak simulation relations have been proposed ((B. J ...
The paper contains description of the implementation of C code for tree representation of Markov Chain Monte Carlo(MCMC) clustering. The aim of the code is to produce results which helps in visual representation of the most frequent pattern, its agglomerat ...
This paper presents a novel algorithm for robust object recognition. We propose to model the visual appearance of objects via probability density functions. The algorithm consists of a fully connected Markov random field with energy function derived from r ...
Skin cancer is a spreading disease in the western world. Early detection and treatment are crucial for improving the patient survival rate. In this paper we present two algorithms for computer assisted diagnosis of melanomas. The first is the support vecto ...