Publication

Networked Slepian-Wolf: Theory, Algorithms and Scaling Laws

Related publications (80)

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 VPN problem with concave costs

Laura Sanità

Only recently Goyal, Olver and Shepherd (Proc. STOC, 2008) proved that the symmetric Virtual Private Network Design (sVPN) problem has the tree routing property, namely, that there always exists an optimal solution to the problem whose support is a tree. C ...

2010

Silence-Based Communication

Christina Fragouli

Communication complexity---the minimum amount of communication required---of computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst-case and ...

2010

Impact of Trust Management and Information Sharing to Adversarial Cost in Ranking Systems

Karl Aberer

Ranking systems such as those in product comparison sites and recommender systems usually use ratings to rank favorite items based on both their quality and popularity. Since higher ranked items are more likely selected and yield more revenues for their ow ...

2010

Polychromatic colorings of arbitrary rectangular partitions

Balázs Keszegh

A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex 4-colorings of general partitions where every subrectangle is required to have all four colors appear on i ...

2010

Modifier-Adaptation Methodology for Real-Time Optimization

Dominique Bonvin, Alejandro Gabriel Marchetti

The ability of a model-based real-time optimization scheme to converge to the plant optimum relies on the ability of the underlying process model to predict the plant's necessary conditions of optimality (NCO). These include the values and gradients of the ...

2009

New Hardness Results for Diophantine Approximation

Friedrich Eisenbrand, Thomas Rothvoss

We revisit simultaneous diophantine approximation, a classical problem from the geometry of numbers which has many applications in algorithms and complexity. The input of the decision version of this problem consists of a rational vector \alpha, an error b ...

Springer2009

Source coding in sensor networks

Robert Konsbruck

Wireless sensor networks have emerged as versatile tools to monitor the evolution of physical fields over large areas by means of self-powered and low-cost sensing devices. Although their development was originally motivated by military applications, they ...

EPFL2009

Identity Aware Sensor Networks

Christina Fragouli, Suhas Diggavi, Lorenzo Keller, Mahdi Jafari Siavoshani

In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit---for instance, in many cases, sensors are used to detec ...

2009

Latency-aware Leader Election

André Schiper, Martin Hutle, Nuno Filipe de Sousa Santos

Experimental studies have shown that electing a leader based on measurements of the underlying communication network can be beneficial. We use this approach to study the problem of electing a leader that is eventually not only correct (as aptured by the fa ...

ACM2009

Latency-aware leader election

André Schiper, Martin Hutle, Nuno Filipe de Sousa Santos

Experimental studies have shown that electing a leader based on measurements of the underlying communication network can be beneficial. We use this approach to study the prob- lem of electing a leader that is eventually not only correct (as captured by the ...

ACM Press2009