Concept

Télédiffusion

Publications associées (47)

We formulate a new variant of the index coding problem, where instead of demanding a specific message, clients are pliable, and are interested in receiving any t messages that they do not have. We term this problem pliable index coding or PICOD(t). We prov ...

Ieee-Inst Electrical Electronics Engineers Inc2015

, , , ,

In this paper, we consider an active distribution network (ADN) that performs primary voltage control using real-time demand response via a broadcast low-rate communication signal. The ADN also owns distributed electrical energy storage. We show that it is ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Primary Voltage Control in Active Distribution Networks via Broadcast Signals: The Case of Distributed Storage

Jean-Yves Le Boudec, Mario Paolone, Dan-Cristian Tomozei, Konstantina Christakou, Maryam Bahramipanah

In this paper we consider an Active Distribution Network (ADN) that performs primary voltage control using realtime demand response via a broadcast low-rate communication signal. Additionally, the ADN owns distributed electrical energy storage. We show tha ...

2013

Creating Secrets out of Erasures

Christina Fragouli, Suhas Diggavi, Panagiotis Kostopoulos

Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary ca ...

2013

, ,

In this paper, we take a deterministic approach to the problem of broadcasting nested message sets. We mainly consider the scenario where a common message and a private message are to be encoded into a signal and transmitted over a broadcast channel toward ...

2012

, , ,

Consider a source, Alice, broadcasting private messages to multiple receivers through a broadcast erasure channel; users send back to Alice public feedback that she causally uses to decide the coding strategy for her following transmissions. Recently, the ...

IEEE2012

Effects of sharing text selections on gaze recurrence and interaction quality in a pair programming task

Patrick Jermann, Marc-Antoine Nüssli

We present experimental findings from a dual eye-tracking study that illustrate the effect of different ways of sharing se- lection in remote pair-programming scenario. Forty pairs of engineering students had to complete several program under- standing tas ...

2012

Spectrum sensing is one of the enabling functionalities for cognitive radio systems to operate in the spectrum white space. To protect the primary incumbent users from interference, the cognitive radio is required to detect incumbent signals at very low si ...

IEEE2011

On the Broadcast Capacity of Wireless Networks With Cooperative Relays

Michael Christoph Gastpar

A fundamental problem in wireless networks is determining the broadcast capacity, i.e., the maximum data transfer rate from a given node to every other node in a relay network. This paper studies the scaling of the broadcast capacity for a network with a s ...

2010

, , , , , ,

This paper presents our work towards a decentralized reconfiguration strategy for self-reconfiguring modular robots, assembling furniture-like structures from Roombots metamodules. We explore how reconfiguration by locomotion from a configuration A to a co ...

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

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