Linear Function Computation in Networks: Duality and Constant Gap Results
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.
The identification of kinetic models can be simplified via the computation of extents of reaction on the basis of invariants such as stoichiometric balances. With extents, one can identify the structure and the parameters of reaction rates individually, wh ...
This new publication of The Analogous City, an artwork produced by Aldo Rossi, Eraldo Consolascio, Bruno Reichlin and Fabio Reinhart for the Venice Biennale of Architecture in 1976, is part of a museographic installation for the exhibition Aldo Rossi - The ...
This new publication of The Analogous City, an artwork produced by Aldo Rossi, Eraldo Consolascio, Bruno Reichlin and Fabio Reinhart for the Venice Biennale of Architecture in 1976, is part of a museographic installation for the exhibition Aldo Rossi - The ...
The street-network efficiency of tens of British cities in relation to transport fuel consumption and CO2 emissions are analyzed. The results show a strong linear positive correlation between length entropy and average street length, and a negative correla ...
Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles any circuit into a circuit with the same functionality but resilience against well-defin ...
A k-ary semi-algebraic relation E on R-d is a subset of R-kd, the set of k-tuples of points in R-d, which is determined by a finite number of polynomial inequalities in kd real variables. The description complexity of such a relation is at most t if d, k < ...
The high failure rate expected for future supercomputers requires the design of new fault tolerant solutions. Most checkpointing protocols are designed to work with any message-passing application but suffer from scalability issues at extreme scale. We tak ...
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 classical modulo-lattice construction of Erez et al. has been successfully applied to several coding problems under Gaussian noise, including coding for computation over multiple-access channels (MAC). For the latter problem, an alternative constructio ...
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
