Publication

Over-the-Air Computation via Reconfigurable Intelligent Surface

Publications associées (79)

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

COMMENT ON “MIXING BELIEFS AMONG INTERACTING AGENTS”

Jean-Yves Le Boudec, Javier Gomez Serrano

We comment on the derivation of the main equation in the bounded confidence model of opinion dynamics. In the original work, the equation is derived using an ad-hoc counting method. We point that the original derivation does contain some small mistake. The ...

World Scientific Publ Co Pte Ltd2012

A Distributed Algorithm for Computing the Node Search Number in Trees

Florian Huc

We present a distributed algorithm to compute the node search number in trees. This algorithm extends the centralized algorithm proposed by Ellis et al. (Inf. Comput. 113(1):50-79, 1994). It can be executed in an asynchronous environment, requires an overa ...

2012

Simple Relaying Strategies for Half-duplex Networks

Christina Fragouli, Ayfer Özgür Aydin, Siddhartha Brahma

We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Using simple outer bounds on the capacity of the network, we show that simple relaying strategies having exactly two states and a ...

2012

Simple schedules for half-duplex networks

Christina Fragouli, Siddhartha Brahma

We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Deriving a simple approximation to the capacity of the network, we show that simple schedules having exactly two states and avoid ...

Ieee2012

MEU – A cartographic-based web-platform for urban energy management and planning

Gaëtan Cherix, Massimiliano Capezzali

This paper presents MEU (http://meu.epfl.ch) project results: a new GIS-centric web application for energy management and planning of existing or new urban zones. The project has been carried out with the collaboration of four Western Switzerland cities an ...

2012

A novel sampling theorem on the sphere

Yves Wiaux, Jason Douglas McEwen

We develop a novel sampling theorem on the sphere and corresponding fast algorithms by associating the sphere with the torus through a periodic extension. The fundamental property of any sampling theorem is the number of samples required to represent a ban ...

Institute of Electrical and Electronics Engineers2011

Strongly feasible stochastic model predictive control

Milan Korda

In this article we develop a systematic approach to enforce strong feasibility of probabilistically constrained stochastic model predictive control problems for linear discrete-time systems under affine disturbance feedback policies. Two approaches are pre ...

2011

Recipes on Hard Thresholding Methods

Volkan Cevher, Anastasios Kyrillidis

Compressive sensing (CS) is a data acquisition and recovery technique for finding sparse solutions to linear inverse problems from sub-Nyquist measurements. CS features a wide range of computationally efficient and robust signal recovery methods, based on ...

2011

Fast Interscale Wavelet Denoising of Poisson-Corrupted Images

Michaël Unser, Thierry Blu, Cédric René Jean Vonesch, Florian Luisier

We present a fast algorithm for image restoration in the presence of Poisson noise. Our approach is based on (1) the minimization of an unbiased estimate of the MSE for Poisson noise, (2) a linear parametrization of the denoising process and (3) the preser ...

Elsevier2010

FASTER CADZOW DENOISING BASED ON PARTIAL EIGENVALUE DECOMPOSITION

Yann Barbotin

Certain aspects of the present disclosure relate to a method for speeding up the Cadzow iterative denoising algorithm as a part of the Finite Rate of Innovation (FRI) processing and for decreasing its computational complexity. ...

USPTO2010