Publications related to Efficient Algorithms for the Data Exchange Problem

Parameter Identification to Enforce Practical Observability of Nonlinear Systems

The sensitivity of the unmeasured state variables to the measurements strongly affects the rate of convergence of a state estimation algorithm. To overcome potential observability problems, the approach has been to identify the model parameters so as to re ...

2007

Collective search of a single odour source using cooperation

Alexandre Herrmann

We study coordination strategies for a multirobot team. The goal is to find the source of an odour most efficiently in terms of the distance travelled by the robots and the time required to discover the source. We focus on the problem of finding the source ...

2007

Network Correlated Data Gathering with Explicit Communication: NP-Completeness and Algorithms

Martin Vetterli, Razvan Cristescu

We consider the problem of correlated data gathering by a network with a sink node and a tree based communication structure, where the goal is to minimize the total trans- mission cost of transporting the information collected by the nodes, to the sink nod ...

2006

Computational Hardness and Explicit Constructions of Error Correcting Codes

Mohammad Amin Shokrollahi, Mahdi Cheraghchi Bashi Astaneh

We outline a procedure for using pseudorandom generators to construct binary codes with good properties, assuming the existence of sufficiently hard functions. Specifically, we give a polynomial time algorithm, which for every integers

n

and

k

, constru ...

2006

Network Coding: An Instant Primer

Jean-Yves Le Boudec, Christina Fragouli, Jörg Widmer

Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received information. There are two main b ...

2006

Analysis of Peer-to-Peer File Dissemination amongst Users of Different Upload Capacities

Jochen Mundinger

In recent years, overlay networks have proven an effective way of disseminating a file from a single source to a group of end users via the Internet. A number of algorithms and protocols have been suggested, implemented and studied. In particular, much att ...

2006

VLSI implementation of the list sphere algorithm

Andreas Peter Burg, Matthieu Philippe Emmanuel Zellweger, Christoph Studer

Sphere decoding (SD) is widely considered as one of the most promising detection schemes for multiple-input multiple-output (MIMO) communication systems. The recently proposed list sphere-decoding (LSD) algorithm is an extension of the original SD algorith ...

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

Analysis of peer-to-peer file dissemination

Jochen Mundinger

In recent years, overlay networks have proven a popular way of disseminating potentially large files from a single server S to a potentially large group of N end users via the Internet. A number of algorithms and protocols have been suggested, implemented ...

2006

Network Coding: An Instant Primer

Jean-Yves Le Boudec, Christina Fragouli, Jörg Widmer

Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received information. There are two main b ...

2005

An online throughput-competitive algorithm for multicast routing and admission control

Monika Henzinger, Ashish Goel

We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of requests accepted by the optimum offline algorithm to the expected number of reque ...

2005

Efficient Algorithms for the Data Exchange Problem

Graph Chatbot

Chat with Graph Search

Parameter Identification to Enforce Practical Observability of Nonlinear Systems

Collective search of a single odour source using cooperation

Network Correlated Data Gathering with Explicit Communication: NP-Completeness and Algorithms

Computational Hardness and Explicit Constructions of Error Correcting Codes

Network Coding: An Instant Primer

Analysis of Peer-to-Peer File Dissemination amongst Users of Different Upload Capacities

VLSI implementation of the list sphere algorithm

Analysis of peer-to-peer file dissemination

Network Coding: An Instant Primer

An online throughput-competitive algorithm for multicast routing and admission control

Parameter Identification to Enforce Practical Observability of Nonlinear Systems

VLSI implementation of the list sphere algorithm

Collective search of a single odour source using cooperation

Network Correlated Data Gathering with Explicit Communication: NP-Completeness and Algorithms

Computational Hardness and Explicit Constructions of Error Correcting Codes

Analysis of Peer-to-Peer File Dissemination amongst Users of Different Upload Capacities

Network Coding: An Instant Primer

Analysis of peer-to-peer file dissemination

An online throughput-competitive algorithm for multicast routing and admission control

Network Coding: An Instant Primer