Concept

Vecteur aléatoire

Publications associées (152)

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

Distributed Constraint Optimization

Thomas Léauté

Distributed Constraint Satisfaction (DisCSP) and Distributed Constraint Optimization (DCOP) are formal frameworks that can be used to model a variety of problems in which multiple decision-makers cooperate towards a common goal: from computing an equilibri ...

EPFL2011

MATHICSE Technical Report : A stochastic collocation method for the second order wave equation with a discontiuous random speed

Fabio Nobile

In this paper we propose and analyze a stochastic collocation method for solving the second order wave equation with a random wave speed and subjected to deterministic boundary and initial conditions. The speed is piecewise smooth in the physical space and ...

MATHICSE2011

A PTAS for the Highway Problem

Thomas Rothvoss

In the highway problem, we are given an n-edge line graph (the highway), and a set of paths (the drivers), each one with its own budget. For a given assignment of edge weights (the tolls), the highway owner collects from each driver the weight of the assoc ...

2011

Multivariate extreme models based on underlying skew-t and skew-normal distributions

Simone Padoan

We derive for the first time the limiting distribution of maxima of skew-t random vectors and we show that its limiting case, as the degree of freedom goes to infinity, is the skewed version of the well-known FlOsler-Reiss model. The advantage of the new f ...

2011

Bayesian networks and information theory for audio-visual perception modeling

Jonas Richiardi, Patricia Besson

Thanks to their different senses, human observers acquire multiple information coming from their environment. Complex cross-modal interactions occur during this perceptual process. This article proposes a framework to analyze and model these interactions t ...

2010

The SURE-LET approach to image denoising

Florian Luisier

Denoising is an essential step prior to any higher-level image-processing tasks such as segmentation or object tracking, because the undesirable corruption by noise is inherent to any physical acquisition device. When the measurements are performed by phot ...

EPFL2010

Bayesian networks as generative models for face recognition

Guillaume Heusch

In this thesis, we address the problem of face modelling by using dedicated statistical generative models, with an application to the face authentication task. Face authentication consists in either accepting or rejecting a user's claim supported by its fa ...

EPFL2010

Game Theory in Communications

Vojislav Gajic

Multi-user communication theory typically studies the fundamental limits of communication systems, and considers communication schemes that approach or even achieve these limits. The functioning of many such schemes assumes that users always cooperate, eve ...

EPFL2010

Nonnegative Matrix Factorization and Spatial Covariance Model for Under-Determined Reverberant Audio Source Separation

Pierre Vandergheynst, Rémi Gribonval

We address the problem of blind audio source separation in the under-determined and convolutive case. The contribution of each source to the mixture channels in the time-frequency domain is modeled by a zero-mean Gaussian random vector with a full rank cov ...

2010

"Compressed" Compressed Sensing

Michael Christoph Gastpar

The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples). The question addressed in this paper is whether an even smaller num ...

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