Publication

Structure of optimal schedules in diamond networks

Publications associées (49)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Triangle Network Secrecy

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We characterize the secret message capacity of the triangle network, that consists of a source, a relay and a destination connected through orthogonal erasure channels. A passive eavesdropper, Eve, wiretaps any one of the three channels. The source and the ...

Ieee2014

A simple relaying strategy for diamond networks

Christina Fragouli, Siddhartha Brahma

We consider a Gaussian diamond network where a source communicates with the destination through n non-interfering half-duplex relays. Using simple approximations to the capacity of the network, we show that simple relaying strategies involving two relays a ...

Ieee2014

Method for Combined Water-Energy Recovery in Industrial Processes

Maziar Kermani

This diploma project is a joint effort between Industrial Energy System Laboratory (LENI) of EPFL and CanmetENERGY-Varennes of Natural Resources Canada on the application of advanced process integration methods for the optimal water and energy integration ...

2013

Reconstructing Loopy Curvilinear Structures Using Integer Programming

Pascal Fua, Engin Türetken, Fethallah Benmansour

We propose a novel approach to automated delineation of linear structures that form complex and potentially loopy networks. This is in contrast to earlier approaches that usually assume a tree topology for the networks. At the heart of our method is an Int ...

Ieee2013

Optimal asymptotic bounds for spherical designs

Maryna Viazovska

In this paper we prove the conjecture of Korevaar and Meyers: for each N≥cdtd, there exists a spherical t-design in the sphere Sd consisting of N points, where cd is a constant depending only on d. ...

2013

Distributed optimization via diffusion adaptation

Ali H. Sayed

We develop an iterative diffusion mechanism to optimize a global cost function in a distributed manner over a network of nodes. The cost function is assumed to consist of a collection of individual components, and diffusion strategy allows the nodes to coo ...

IEEE2011

A DSS to Optimize Facings on the Shelf of a Retail Store

Prem Kumar

This paper aims to maximize the profitability of a set of brand SKUs stocked at a particular retailer by optimizing the number of facings for each product. Based on the past data, a set of variables such as retail price of different SKUs, linear footage th ...

2010

Pedestrian localization, tracking and behavior analysis from multiple cameras

Jérôme Berclaz

Video surveillance is currently undergoing a rapid growth. However, while thousands of cameras are being installed in public places all over the world, computer programs that could reliably detect and track people in order to analyze their behavior are not ...

EPFL2010

Méthodologie de la synthèse des systèmes énergétiques industriels

Raffaele Bolliger

This work presents a synthesis method that leads to the preliminary design of industrial energy systems. Such systems are composed of several technologies that transform, through a set of physical unit operations, raw materials and energy into products and ...

EPFL2010

Context-adaptive information flow allocation and media delivery in online social networks

Pascal Frossard

This paper investigates context-driven flow allocation and media delivery in online social networks. We exploit information on contacts and content preferences found in social networking applications to provide efficient network services and operation at t ...

2010