Publication

The virtue of patience in low complexity scheduling of packetized media with feedback

Related publications (54)

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.

Prioritized Distributed Video Delivery with Randomized Network Coding

Pascal Frossard, Nikolaos Thomos, Jakov Cakareski

We address the problem of prioritized video streaming over lossy overlay networks. We propose to exploit network path diversity via a novel Randomized Network Coding (RNC) approach that provides unequal error protection (UEP) to the packets conveying the v ...

2011

Routing and search on large scale networks

Dominique Florian Tschopp

In this thesis, we address two seemingly unrelated problems, namely routing in large wireless ad hoc networks and comparison based search in image databases. However, the underlying problem is in essence similar and we can use the same strategy to attack t ...

EPFL2010

A Weighting Scheme for Enhancing Community Detection in Networks

Martin Hasler, Alireza Khadivi

Many algorithms have recently been proposed for finding communities in networks. By definition, a community is a subset of vertices with a high number of connections among the vertices, but only few connections with other vertices. The worst drawback of mo ...

IEEE2010

Prioritized Distributed Video Delivery with Randomized Network Coding

Pascal Frossard, Nikolaos Thomos, Jakov Cakareski

2010

Graph-based classification of multiple observation sets

Pascal Frossard, Effrosyni Kokiopoulou

We consider the problem of classification of multiple observations of the same object, possibly under different transformations. We view this problem as a special case of semi-supervised learning where all unlabelled examples belong to the same unknown cla ...

Elsevier2010

Constructing and decoding GWBE codes using Kronecker products

Mohammadjavad Faraji, Pedram Pad

In this letter, we introduce a novel method for constructing large size generalized Welch bound equality (GWBE) matrices. This method can also be used for the construction of large WBE matrices. The advantage of this method is its low complexity for constr ...

Institute of Electrical and Electronics Engineers2010

Function computation via subspace coding

Christina Fragouli, Nikhil Karamchandani

This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that req ...

2010

Function computation via subspace coding

Christina Fragouli, Lorenzo Keller, Nikhil Karamchandani

2010

Distributed Rate Allocation for Network-coded Systems

Christina Fragouli, Amin Jafarian

This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multic ...

2009

Distributed rate allocation for network-coded systems

Christina Fragouli, Amin Jafarian

2009