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.
We study the scaling of the broadcast capacity for a network with a single source and f(N) cooperative relays where N is the number of destinations and f(.) is an increasing function. We consider random extended networks (the network area goes to infinity ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007
We study oblivious deterministic gossip algorithms for multi-channel radio networks with a malicious adversary. In a multi-channel network, each of the n processes in the system must choose, in each round, one of the c channels of the system on which to pa ...
This paper considers the k-set-agreement problem in a synchronous message passing distributed system where up to t processes can fail by crashing. We determine the number of communication rounds needed for all correct processes to reach a decision in a giv ...
In this paper we evaluate the free energy of the dilute p-spin model at finite temperature. Franz et al gave the first step to rigourize the replica solution for the dilute p-spin model by proving that the solution given by the Parisi replica scheme is a l ...
We present two upper bounds on the capacity of the i.i.d. binary deletion channel, where each bit is independently deleted with a fixed probability d. The first can be numerically evaluated for any fixed d. The second provides an asymptotic upper bound as ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007
An upper bound is established on the usefulness of noisy feedback for the two-user multiple-access channel (MAC). The bound generalizes a dependence-balance argument developed by Hekstra and Willems for the common-output two-way channel and the MAC with no ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2006
Many reliable distributed systems are consensus-based and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery mode following asynchrony and failures. A lot of work has been devoted to optimize th ...
The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is ...
Institute of Electrical and Electronics Engineers2005
We present a technique for the rapid and reliable prediction of linear-functional outputs of coercive and non-coercive linear elliptic partial differential equations with affine parameter dependence. The essential components are: (i) rapidly convergent glo ...
In this paper our recent results in the capacity of single relay erasure channels are used to derive a new and tighter cut-set bound. We initially present a simple and intuitive approach to derive the classical cut-set bound in General Multi-Terminal Erasu ...
