Concept

Réseau bayésien

Publications associées (338)

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

Bayesian inference from composite likelihoods, with an application to spatial extremes

Anthony Christopher Davison

Composite likelihoods are increasingly used in applications where the full likelihood is analytically unknown or computationally prohibitive. Although some frequentist properties of the maximum composite likelihood estimator are akin to those of the maximu ...

Academia Sinica, Institute of Statistical Science2012

Message-Passing De-Quantization with Applications to Compressed Sensing

Ulugbek Kamilov

Estimation of a vector from quantized linear measurements is a common problem for which simple linear techniques are suboptimal—sometimes greatly so. This paper develops message-passing de-quantization (MPDQ) algorithms for minimum mean-squared error estim ...

IEEE2012

Integrated Transportation and Urban Infrastructure Systems: Planning and Design

Bilal Farooq

Planning and design of urban infrastructure systems in general and transportation systems in particular, require a multidisciplinary effort that is heavily embedded in a system-of-systems perspective. The envisioned research direction is a bottom-up approa ...

2012

Properties of Network Polynomials

Christina Fragouli, Javad Ebrahimi Boroojeni

It is well known that transfer polynomials play an important role in the network code design problem. In this paper we provide a graph theoretical description of the terms of such polynomials. We consider acyclic networks with arbitrary number of receivers ...

2012

Properties of Network Polynomials

Javad Ebrahimi Boroojeni

Ieee2012

Light Field Compressive Sensing In Camera Arrays

Pierre Vandergheynst, Mohammad Golbabaee, Mahdad Hosseini Kamal

This paper presents a novel approach to capture light field in camera arrays based on the compressive sensing framework. Light fields are captured by a linear array of cameras with overlapping field of view. In this work, we design a redundant dictionary t ...

Ieee2012

Light Field Compressive Sensing in Camera Arrays

Pierre Vandergheynst, Mohammad Golbabaee, Mahdad Hosseini Kamal

Ieee2012

Modeling dominance effects on nonverbal behaviors using granger causality

Daniel Gatica-Perez, Oya Aran, Dinesh Babu Jayagopi

In this paper we modeled the effects that dominant people might induce on the nonverbal behavior (speech energy and body motion) of the other meeting participants using Granger causality technique. Our initial hypothesis that more dominant people have gene ...

2012

Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference

Matthias Seeger

We propose a novel algorithm to solve the expectation propagation relaxation of Bayesian inference for continuous-variable graphical models. In contrast to most previous algorithms, our method is provably convergent. By marrying convergent EP ideas from (O ...

2011

Bayesian Rendezvous for Distributed Robotic Systems

Alcherio Martinoli, Sven Adrian Gowal

In this paper, we state, using thorough mathe- matical analysis, sufficient conditions to perform a rendezvous maneuver with a group of differential-wheeled robots endowed with an on-board, noisy, local positioning system. In particular, we extend the exis ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011