Concept

Exponential family

Related publications (136)

Hyperbolic angular statistics for globally coupled oscillators

Max-Olivier Hongler, Roger Filliger, Philippe Blanchard

We analytically discuss a multiplicative noise generalization of the Kuramoto- Sakaguchi dynamics for an assembly of globally coupled phase oscillators. In the mean-ﬁeld limit, the resulting class of invariant measures coincides with a generalized, two-par ...

2010

Multilingual acoustic modeling for speech recognition based on subspace Gaussian Mixture Models

Pinar Akyazi, Samuel Thomas

Although research has previously been done on multilingual speech recognition, it has been found to be very difficult to improve over separately trained systems. The usual approach has been to use some kind of “universal phone set” that covers multiple lan ...

IEEE2010

Learning in Gaussian Markov random fields

Thomas Riedl

This paper addresses the problem of state estimation in the case where the prior distribution of the states is not perfectly known but instead is parameterized by some unknown parameter. Thus in order to support the state estimator with prior information o ...

2010

Multichannel Compressed Sensing via Source Separation for Hyperspectral Images

Pierre Vandergheynst, Mohammad Golbabaee

This paper describes a novel framework for compressive sampling of multichannel signals that are highly correlated across the channels. In this work, we assume few number of independent sources are generating the multichannel observations based on a linear ...

2010

Power Law and Exponential Decay of Intercontact Times between Mobile Devices

Jean-Yves Le Boudec, Milan Vojnovic

We examine the fundamental properties that determine the basic performance metrics for opportunistic communications. We first consider the distribution of intercontact times between mobile devices. Using a diverse set of measured mobility traces, we find a ...

2010

Analysis of Implicit Choice Set Generation Using the Constrained Multinomial-Logit Model

Michel Bierlaire, Gunnar Flötteröd, Ricardo Daniel Hurtubia González

Discrete choice models are defined conditional to the knowledge of the actual choice set by the analyst. The common practice for many years is to assume that individual-based choice sets can be deterministically generated based on the choice context and th ...

2010

Subspace Gaussian Mixture Models for speech recognition

Pinar Akyazi, Samuel Thomas

We describe an acoustic modeling approach in which all phonetic states share a common Gaussian Mixture Model structure, and the means and mixture weights vary in a subspace of the total parameter space. We call this a Subspace Gaussian Mixture Model (SGMM) ...

2010

A Network Based Kernel Density Estimator Applied to Barcelona Economic Activities

Stéphane Joost, Emanuele Strano, Timothée Produit, Nicolas Lachance-Bernard

This paper presents a methodology to compute an innovative density indicator of spatial events. The methodology is based on a modified Kernel Density Estimator (KDE) that operates along road networks, and named Network based Kernel Density Estimator (NetKD ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

The Metropolized Partial Importance Sampling MCMC mixes slowly on minimal reversal rearrangement paths

Krister Swenson

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. ...

2010

On finding another room-partitioning of the vertices

Laura Sanità

Let T be a triangulated surface given by the list of vertex-triples of its triangles, called rooms. A room-partitioning of T is a subset R of the rooms such that each vertex of T is in exactly one room in R. We prove that if T has a room-partitioning R, th ...

2010

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.