Concept

Propriété de Markov

Publications associées (221)

Finding Steady States of Communicating Markov Processes Combining Aggregation/Disaggregation with Tensor Techniques

Francisco Santos Paredes Quartin de Macedo

Stochastic models for interacting processes feature a dimensionality that grows exponentially with the number of processes. This state space explosion severely impairs the use of standard methods for the numerical analysis of such Markov chains. In this wo ...

Springer Int Publishing Ag2016

HMM-based Non-native Accent Assessment using Posterior Features

Milos Cernak, Ramya Rasipuram

Automatic non-native accent assessment has potential benefits in language learning and speech technologies. The three fundamental challenges in automatic accent assessment are to characterize, model and assess individual variation in speech of the non-nati ...

2016

Traffic Pattern Analysis and Anomaly Detection via Probabilistic Inference Model

Kwang Moo Yi

In this chapter, we introduce a method for trajectory pattern analysis through the probabilistic inference model with both regional and velocity observations. By embedding Gaussian models into the discrete topic model framework, our method uses continuous ...

Springer Netherlands2016

Exploiting Low-dimensional Structures to Enhance DNN based Acoustic Modeling in Speech Recognition

Hervé Bourlard, Afsaneh Asaei, Pranay Dighe

We propose to model the acoustic space of deep neural network (DNN) class-conditional posterior probabilities as a union of lowdimensional subspaces. To that end, the training posteriors are used for dictionary learning and sparse coding. Sparse representa ...

ICASSP2016

Lyapunov Exponents for Branching Processes in a Random Environment: The Effect of Information

Sophie Myriam Hautphenne

We consider multitype branching processes evolving in a Markovian random environment. To determine whether or not the branching process becomes extinct almost surely is akin to computing the maximal Lyapunov exponent of a sequence of random matrices, which ...

Springer Verlag2016

Acoustic data-driven grapheme-to-phoneme conversion in the probabilistic lexical modeling framework

Ramya Rasipuram, Marzieh Razavi

One of the primary steps in building automatic speech recognition (ASR) and text-to-speech systems is the development of a phonemic lexicon that provides a mapping between each word and its pronunciation as a sequence of phonemes. Phoneme lexicons can be d ...

2016

Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets

Giovanni Migliorati

We present novel Markov-type and Nikolskii-type inequalities for multivariate polynomials associated with arbitrary downward closed multi-index sets in any dimension. Moreover, we show how the constant of these inequalities changes, when the polynomial is ...

Elsevier2015

LOD Generation for Urban Scenes

Yannick Verdie

We introduce a novel approach that reconstructs 3D urban scenes in the form of levels of detail (LODs). Starting from raw data sets such as surface meshes generated by multi-view stereo systems, our algorithm proceeds in three main steps: classification, a ...

Association for Computing Machinery2015

Fast and Accurate Inference of Plackett-Luce Models

Matthias Grossglauser, Lucas Maystre

We show that the maximum-likelihood (ML) estimate of models derived from Luce’s choice axiom (e.g., the Plackett–Luce model) can be expressed as the stationary distribution of a Markov chain. This conveys insight into several recently proposed spectral inf ...

2015

Measuring and Synthesizing Systems in Probabilistic Environments

Barbara Jobstmann, Rishabh Singh

The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under ...

Assoc Computing Machinery2015

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.

Connectez-vous pour utiliser Chat avec Graph Search