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 examine the fundamental properties that determine the basic performance metrics for opportunistic communications. We first consider the distribution of intercontact times between mobile devices. Using a diverse set of measured mobility traces, we find a ...
We present the continuation of our long-term spectroscopic monitoring of the gravitationally lensed quasar QSO 2237 + 0305. We investigate the chromatic variations observed in the UV/optical continuum of both quasar images A and B, and compare them with nu ...
This paper deals with scale models of power distribution systems for the study of lightning induced voltages on overhead lines. The scale model technique is useful for the investigation of situations which are prohibitively complex to be treated theoretica ...
Online social networks have gained importance in recent years. Furthermore, there is a need for designing smart applications for social networks which take into account the behaviour of dynamical processes over these networks. This requires structural know ...
We want to extend the approximation of the error probability via a scaling approach from the BEC to general binary-input memoryless output-symmetric (BMS) channels. In particular, we consider such scaling laws for regular LDPC ensembles and message-passing ...
In this paper we consider the finite-length performance of Repeat-Accumulate codes in the waterfall region assuming the transmission on the binary erasure channel. We extend the finite-length scaling law of LDPC codes [1] to this ensemble and we derive the ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008
In this paper we consider the finite-length performance of turbo codes in the waterfall region assuming the transmission on the binary erasure channel. We extend the finite-length scaling law of LDPC codes [1] and of Repeat-Accumulate codes [3] to this ens ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008
The paper presents an in depth assessment of different similarity laws for the mean velocity profile in zero pressure gradient (ZPG) turbulent boundary layers (TBL's) in comparison with mostly experimental and few computational data. The emphasis is on the ...
The capacity scaling of extended two-dimensional wireless networks is known in the high attenuation regime, i.e. when the power path loss exponent alpha is greater than 4. This has been accomplished by deriving information theoretic upper bounds for this r ...
Scaling provides an elegant framework for understanding power-law behavior and deducing relationships between critical exponents. We demonstrate that scaling theory can be generalized to develop a framework for the analysis of diverse empirical macroecolog ...
