Publication

A lower bound to the scaling behavior of sensor networks

Related publications (64)

Using RASTA in task independent TANDEM feature extraction

John David Scott Dines, Guillermo Aradilla

In this work, we investigate the use of RASTA filter in the TANDEM feature extraction method when trained with a task independent data. RASTA filter removes the linear distortion introduced by the communication channel which is demonstrated in a 18% relat ...

IDIAP2004

Using RASTA in task independent TANDEM feature extraction

John David Scott Dines, Guillermo Aradilla

2004

Scheduling data transfers in a network and the set scheduling problem

Monika Henzinger, Ashish Goel

In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that opt ...

2003

Analysis of power line communication networks using a new approach based on an efficient measurement technique

Emmanuel Marthe

In this paper, we present an efficient measurement technique for the analysis of power line communication (PLC) signals. The frequency spectrum associated with PLC signals extends from 1 MHz to 30 MHz. The proposed technique can be applied to a network con ...

2003

Algorithms for Location-Independent Communication between Mobile Agents

We study the distributed infrastructures required for location-independent communication between mobile agents. These infrastructures are problematic: different applications may have very different patterns of migration and communication, and require diffe ...

2001

Network Calculus

Jean-Yves Le Boudec, Patrick Thiran

Network Calculus is a collection of results based on Min-Plus algebra, which applies to deterministic queuing systems found in communication networks. It can be used for example to understand - the computations for delays used in the IETF guaranteed servic ...

Springer Verlag2001

Solving consensus

Distributed systems are the basis of widespread computing facilities enabling many of our daily life activities. Telebanking, electronic commerce, online booking-reservation, and telecommunication are examples of common services that rely on distributed sy ...

EPFL2000

A short tutorial on network calculus I: fundamental bounds in communication networks

Jean-Yves Le Boudec, Patrick Thiran

A short tutorial on network calculus, part I ...

2000

A short tutorial on network calculus II: min-plus system theory applied to communication networks

Jean-Yves Le Boudec, Patrick Thiran

A short tutorial on network calculus, part II ...

2000

Scheduling data transfers in a network and the set scheduling problem

Monika Henzinger, Ashish Goel

ACM1999

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.