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.
We consider multiple description coding for the Gaussian source with K descriptions under the symmetric mean squared error distortion constraints. One of the main contributions is a novel lower bound on the sum rate, derived by generalizing Ozarow’s well-k ...
Training with one type of a visual stimulus usually improves performance. When observers train with two or more stimulus types presented in random order (so-called roving), performance improves for certain stimulus types but not for others. To understand w ...
The simulation of mobility models such as the random waypoint often cause subtle problems, for example the decay of average speed as the simulation progresses, a difference between the long term distribution of nodes and the initial one, and sometimes the ...
Recent studies have shown that biological neural systems are able to use noise and non linearities to improve the information processing which is occurred in. This thesis focus on this topic. We investigate the links between some operations of signal proce ...
Recent work has shown that for some multi-user networks, carefully controlling the algebraic structure of the coding scheme may be just as useful as selecting the correct input distribution. In particular, for linear channel models, including finite field ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information processing over networks. However for many topologies that are realistic for wireless ad-hoc and sensor ...
An achievable bit rate per source-destination pair in a wireless network of n randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that randomly scattered nodes can achieve, with high probability, the ...
We show that for a voter model on {0,1}Z corresponding to a random walk with kernel p(·) and starting from unanimity to the right and opposing unanimity to the left, a tight interface between 0's and 1's exists if p(·) has second moments but does not if p( ...
Mobile wireless ad hoc and sensor networks can be permanently partitioned in many interesting scenarios. This implies that instantaneous end-to-end routes do not exist. Nevertheless, when nodes are mobile, it is possible to forward messages to their destin ...
We introduce a novel behavioral model to describe pedestrians motions, which is able to capture sophisticated motion patterns resulting from the mixture of different categories of random trajectories. Due to its simplicity, this model can be learned from v ...