Publication

Cooperative Data Exchange with Weighted Cost based on d-Basis Construction

Related publications (45)

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.

Capital goods, measured TFP and growth: The case of Spain

Luis Franjo Garcia

The effect of investing in equipment and/or structures on TFP and long run growth is investigated here. We argue that economies can grow in spite of stagnant TFP if the investment rate is inefficiently high. We study the case of Spain where real GDP per wo ...

Elsevier Science Bv2016

Multiple-field based code generator and decoder for communications systems

Mohammad Amin Shokrollahi, Lorenz Minder

A method of encoding data for transmission from a source to a destination over a communications channel is provided. The method operates on an ordered set of input symbols and includes generating a plurality of redundant symbols from the input symbols base ...

2016

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Pascal Frossard

In free viewpoint video, a viewer can choose at will any camera angle or the so-called "virtual view" to observe a dynamic 3-D scene, enhancing his/her depth perception. The virtual view is synthesized using texture and depth videos of two anchor camera vi ...

2015

The economic performance of Swiss drinking water utilities

Andrea Baranzini, Anne-Kathrin Faust

This paper measures the performance in terms of costs of Swiss drinking water utilities accounting for environmental factors. We estimate a translog stochastic variable cost frontier using two different techniques on an unbalanced panel of 141 water distri ...

Springer Verlag2014

Fast Byzantine Agreement

Rachid Guerraoui, Florian Huc

This paper presents the first probabilistic Byzantine Agreement algorithm whose communication and time complexities are poly-logarithmic. So far, the most effective probabilistic Byzantine Agreement algorithm had communication complexity and time complexit ...

2013

Cooperative guidance of UAVs for area exploration with final target allocation

Tomasz Tadeusz Gorecki

Fulfillment of complex missions, such as zone watching or multiple target tracking by an UAV can prove very demanding in terms of vehicle ability. A potential way of lessening these demands consists in splitting the initial task into several complementary ...

2013

Data Exchange Problem with Helpers

Michael Christoph Gastpar, Sameer Pawar

In this paper we construct a deterministic polyno- mial time algorithm for the problem where a set of users is interested in gaining access to a common file, but where each has only partial knowledge of the file. We further assume the existence of another ...

2012

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

Springer Verlag2012

Optimizing Data-Center TCO with Scale-Out Processors

Babak Falsafi, Boris Robert Grot, Pejman Lotfi Kamran

Performance and total cost of ownership (TCO) are key optimization metrics in large-scale data centers. According to these metrics, data centers designed with conventional server processors are inefficient. Recently introduced processors based on low-power ...

Institute of Electrical and Electronics Engineers2012

Deterministic algorithm for the cooperative data exchange problem

Michael Christoph Gastpar, Sameer Pawar

Download Citation Email Print Request Permissions Save to Project In this paper we study the problem of data exchange, where each node in the system has a number of linear combinations of the data packets. Communicating over a public channel, the goal is f ...

IEEE2011