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.
Let G be a finite group and let k be a field. Our purpose is to investigate the simple modules for the double Burnside ring kB(G,G). It turns out that they are evaluations at G of simple biset functors. For a fixed finite group H, we introduce a suitable b ...
Motivated by financial applications, we study convex analysis for modules over the ordered ring L0 of random variables. We establish a module analogue of locally convex vector spaces, namely locally L0-convex modules. In this context, we prove hyperplane s ...
Among anonymity systems, DC-nets have long held attraction for their resistance to traffic analysis attacks, but practical implementations remain vulnerable to internal disruption or “jamming” attacks, which require time-consuming detection procedures to r ...
In this paper, we discuss a framework for the distributed compression of vector sources, based on our previous work on distributed transform coding. In particular, our goal is to develop a strategy of first applying a suitable distributed Karhunen-Loeve tr ...
This thesis deals with the study of G-forms and particulary the trace form of a G-Galois algebra. Let k be a field of characteristic not two. Let G be a finite group and L a G-Galois algebra over k. We define the trace form qL by qL(x, y) = TrL/k(xy) for a ...
This paper presents an alternative approach to the deterministic global optimisation of problems with ordinary differential equations in the constraints. The algorithm uses a spatial branch-and-bound approach and a novel procedure to build convex underesti ...
We consider a method to efficiently evaluate in a real-time context an output based on the numerical solution of a partial differential equation depending on a large number of parameters. We state a result allowing to improve the computational performance ...
