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.
In this paper, we study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. In short, we show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. In the ...
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 ...
We investigate the tunneling-percolation mechanism of DC transport nonuniversality for conducting particles of diameter Φ placed in series within the bonds of length Lof a regular lattice model. When L/Φ→∞ the resulting bond conductance distribution functi ...
We do a case study of two different analysis techniques for studying the stochastic behavior of a randomized system/algorithms: (i) The first approach can be broadly termed as a mean value analysis (MVA), where the evolution of the mean state is studied as ...
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output sequences (up to certain bits). An upper bound of the correlations is given, wh ...
This paper analyzes the performance of the simple thresholding algorithm for sparse signal representations. In particular, in order to be more realistic we introduce a new probabilistic signal model which assumes randomness for both the amplitude and also ...
We give a general proof of aging for trap models using the arcsine law for stable subordinators. This proof is based on abstract conditions on the potential theory of the underlying graph and on the randomness of the trapping landscape. We apply this proof ...
This invention discloses new methods, security devices and apparatuses for authenticating documents and valuable articles which may be applied to any support, including transparent synthetic materials and traditional opaque materials such as paper. The inv ...
Recently, Shayevitz and Feder introduced an individual sequence formulation of channel coding under model uncertainty and an elegant coding strategy that adapts Horstein's scheme to this setting to achieve the empirical capacity of the channel. Their schem ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007
We present a model for reverse domain nucleation in ferroelectrics, which takes into account ferroelectric-electrode coupling in both homogeneous and random cases. The model provides a solution to the coercivity paradox-i.e., the large discrepancy between ...