Publication

Network coding for undirected information exchange

Related publications (39)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

The security of VANETs

Jean-Pierre Hubaux, Maxime Raya

In this work, we address the security of VANETs. We provide a detailed threat analysis and devise an appropriate security architecture. We also describe some major design decisions still to be made, which in some cases have more than mere technical implica ...

2005

On the Throughput Improvement due to Limited Complexity Processing at Relay Nodes

Christina Fragouli

We consider a source that transmits information to a receiver by routing it over a communication network represented by a graph and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that there exist config ...

2005

Consensus with Unknown Participants or Fundamental Self-Organization

André Schiper, David Cavin, Yoav Sasson

We consider the problem of bootstrapping self-organized mobile ad hoc networks (MANET), i.e. reliably determining in a distributed and self- organized manner the services to be offered by each node when neither the identity nor the number of the nodes in t ...

2004

From a Static Impossibility to an Adaptive Lower Bound: The Complexity of Early Deciding Set Agreement

Rachid Guerraoui, Bastian Pochon

Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This is because the topological questions that underly set agreement are not about ...

2004

Combinatorial Approach for Data Binarization

This paper addresses the problem of transforming arbitrary data into binary data. This is intended as preprocessing for a supervised classification task. As a binary mapping compresses the total information of the dataset, the goal here is to design such a ...

IDIAP1999

Combinatorial Approach for Data Binarization

Springer1999

Sufficient conditions for the existence of Q-balls in gauge theories

1998

Experimental Investigation of a Hermetic Scroll Expander–Generator.

Daniel Favrat

This paper describes a 1 to 3.5 kWe hermetic scroll expander generator modified from a standard hermetic compressor, an organic Rankine cycle test facility built to test expanders up to 10 kWe and a set of experimental results using HFC 134a in the dry vap ...

1994

Sensitivity of two-dimensional spectra

Geoffrey Bodenhausen

The effect of exptl. parameters on the sensitivity of 2-dimensional NMR expts. was analyzed. A set of recommendations is provided for maximizing the sensitivity of a given expt. in terms of parameters such as sampling rates, acquisition times, and weightin ...

1984