Reconstruction using approximate message passing methods
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.
Many pharmaceutical products find their way into receiving waters, giving rise to concerns regarding their environmental impact. A procedure was proposed that enables ranking of the hazard to aquatic species and human health due to such products. In the pr ...
This paper focuses on the statistical analysis of an adaptive real-time feedback scheduling technique based on imprecise computation. We consider two-version tasks made of a mandatory and an optional part to be scheduled according to a feedback control rat ...
Existing models for serving continuous streams from disks are generally based on worst-case deterministic head displacement times and on a round-robin strand service approach consisting of serving all strands once per round. We propose an alternative appro ...
We report on recent results on the spectral statistics of the discrete Anderson model in the localized phase. Our results show, in particular, that, for the discrete Anderson Hamiltonian with smoothly distributed random potential at sufficiently large coup ...
The kurtosis of a signal is a quantitative measure of how `peaky' it is. In this paper we consider two scenarios of communication over fading channels with kurtosis constraints: in the first, we analyze a non-coherent Rayleigh fading channel where the inpu ...
We consider the capacity planning of telecommunications networks with linear investment costs and uncertain future traffic demands. Transmission capacities must be large enough to meet, with a high quality of service (QoS), the range of possible demands, a ...
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 ...
Probabilistic programming is a powerful high-level paradigm for probabilistic modeling and inference. We present Odds, a small domain-specific language (DSL) for probabilistic programming, embedded in Scala. Odds provides first-class support for random var ...
Many applications that require distributed optimization also include uncertainty about the problem and the optimization criteria themselves. However, current approaches to distributed optimization assume that the problem is entirely known before optimizati ...
A random variable dominates another random variable with respect to the covariance order if the covariance of any two monotone increas- ing functions of this variable is smaller. We characterize completely the covariance order, give strong sufficient conditi ...
