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.
Function computation over Gaussian networks with orthogonal components is studied for arbitrarily correlated discrete memoryless sources. Two classes of functions are considered: 1) the arithmetic sum function and 2) the type function. The arithmetic sum f ...
Institute of Electrical and Electronics Engineers2014
A graph drawn in the plane is called k-quasi-planar if it does not contain k pair-wise crossing edges. It has been conjectured for a long time that for every fixed k, the maximum number of edges of a k-quasi-planar graph with n vertices is O(n). The best k ...
Function computation of arbitrarily correlated discrete sources over Gaussian networks with multiple access components but no broadcast is studied. Two classes of functions are considered: the arithmetic sum function and the frequency histogram function. T ...
The classic weighted averages (WA) algorithm for the evaluation of Sommerfeld-like integrals is reviewed and reappraised. As a result, a new version of the WA algorithm, called generalized WA, is introduced. The new version can be considered as a generaliz ...
Institute of Electrical and Electronics Engineers2012
According to a well known theorem of Haussler and Welzl (1987), any range space of bounded VC-dimension admits an epsilon-net of size O (1/epsilon log 1/epsilon). Using probabilistic techniques, Pach and Woeginger (1990) showed that there exist range space ...
Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011
A new version of the weighted averages (WA) algorithm, called generalized WA, is introduced. Generalized WA exhibit a more compact formulation, devoid of iterative and recursive steps, and a wider range of applications. It is more robust, as it provides a ...
We consider multiple non-colocated sources commu- nicating over a network to a common sink. We assume that the network operation is fixed, and its end result is to convey a fixed linear deterministic transformation of the source data to the sink. This line ...
This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for comput- ing functions, that r ...
In linear function computation, multiple source nodes communicate across a relay network to a single destination whose goal is to recover linear functions of the original source data. When the relay network is a linear deterministic network, a duality rela ...
Institute of Electrical and Electronics Engineers2013
We investigate the role of interaction for computa- tion problem settings where nodes intend to compute functions of the raw messages generated at other nodes. In this work, we make some progress on a more elementary research component: feedback. Specifica ...
