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 provide an exact deterministic reformulation for data-driven chance constrained programs over Wasserstein balls. For individual chance constraints as well as joint chance constraints with right-hand side uncertainty, our reformulation amounts to a mixed ...
A local weighted discontinuous Galerkin gradient discretization method for solving ellipticequations is introduced. The local scheme is based on a coarse grid and successively improvesthe solution solving a sequence of local elliptic problems in high gradi ...
We propose a way to estimate the value function of a convex proximal minimization problem. The scheme constructs a convex set within which the optimizer resides and iteratively refines the set every time that the value function is sampled, namely every tim ...
Given a topological modular functor V in the sense of Walker, we construct vector bundles Z (lambda) over bar, over (M) over bar (g,n) whose Chern characters define semi-simple cohomological field theories. This construction depends on a determinati ...
The calculation of the electronic structure of chemical systems, necessitates computationally expensive approximations to the time-independent electronic Schrödinger equation in order to yield static properties in good agreement with experimental results. ...
We explore a few algebraic and geometric structures, through certain questions posed by modern cryptography. We focus on the cases of discrete logarithms in finite fields of small characteristic, the structure of isogeny graphs of ordinary abelian varietie ...
Fully homomorphic encryption (FHE) has been among the most popular research topics of the last decade. While the bootstrapping-based, public key cryptosystems that follow Gentry's original design are getting more and more efficient, their performance is st ...
We propose a way to estimate the value function of a convex proximal minimization problem. The scheme constructs a convex set within which the optimizer resides and iteratively refines the set every time that the value function is sampled, namely every tim ...
Solving hyperbolic conservation laws on general grids can be important to reduce the computational complexity and increase accuracy in many applications. However, the use of non-uniform grids can introduce challenges when using high-order methods. We propo ...
Authenticated Encryption (AE) is a symmetric key cryptographic primitive that ensures confidentiality and authenticity of processed messages at the same time. The research
of AE as a primitive in its own right started in 2000.The security goals of AE wer ...