Towards a High-Speed Quantum Random Number Generator
Graph Chatbot
Chattez avec Graph Search
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 perform a general optimization of the parameters in the Multilevel Monte Carlo (MLMC) discretization hierarchy based on uniform discretization methods with general approximation orders and computational costs. Moreover, we discuss extensions to non-unif ...
In this work we consider quasi-optimal versions of the Stochastic Galerkin method for solving linear elliptic PDEs with stochastic coefficients. In particular, we consider the case of a finite number N of random inputs and an analytic dependence of the s ...
In this paper, we evaluate the performances of state-of-the art higher-order masking schemes for the AES. Doing so, we pay a particular attention to the comparison between specialized solutions introduced exclusively as countermeasures against side-channel ...
In this work we consider quasi-optimal versions of the Stochastic Galerkin Method for solving linear elliptic PDEs with stochastic coeffcients. In particular, we consider the case of a finite number N of random inputs and an analytic dependence of the solu ...
We investigate the convergence rate of approximations by finite sums of rank-1 tensors of solutions of multiparametric elliptic PDEs. Such PDEs arise, for example, in the parametric, deterministic reformulation of elliptic PDEs with random field inputs, ba ...
Society for Industrial and Applied Mathematics2010
In October 2010, researchers from diverse backgrounds collided at the historic Cumberland Lodge (Windsor, UK) to discuss the role of randomness in cell and developmental biology. Organized by James Briscoe and Alfonso Marinez-Arias, The Company of Biologis ...
Security in mobile communications is a topic of increasing relevance in everyday life. We all use mobile devices for everyday communications, maybe even for exchanging confidential information with the work place. This requires security systems that are re ...
Randomized techniques play a fundamental role in theoretical computer science and discrete mathematics, in particular for the design of efficient algorithms and construction of combinatorial objects. The basic goal in derandomization theory is to eliminate ...
Peer-to-peer content dissemination applications suffer immensely from freeriders, i.e., nodes that do not provide their fair share. The Tit-for-Tat (TfT) incentives have received much attention as they help make such systems more robust against freeriding. ...
This invention discloses new methods and security devices for authenticating documents and valuable products which may be applied to any support, including transparent synthetic materials and traditional opaque materials such as paper. The invention relate ...
