Mixture Of Kernels And Iterated Semidirect Product Of Diffeomorphisms Groups
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.
Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest ...
Let W be a vector space over an algebraically closed field k. Let H be a quasisimple group of Lie type of characteristic p not equal char(k) acting irreducibly on W. Suppose also that G is a classical group with natural module W, chosen minimally with resp ...
We study a natural generalization of the problem of minimizing makespan on unrelated machines in which jobs may be split into parts. The different parts of a job can be (simultaneously) processed on different machines, but each part requires a setup time b ...
Gaussian random fields are widely used as building blocks for modeling stochastic processes. This paper is concerned with the efficient representation of d-point correlations for such fields, which in turn enables the representation of more general stochas ...
Let G be a finite group and (K, O, k) be a p-modular system. Let R = O or k. There is a bijection between the blocks of the group algebra and the blocks of the so-called p-local Mackey algebra mu(1)(R)(G). Let b be a block of RG with abelian defect group D ...
This thesis is in the context of representation theory of finite groups. More specifically, it studies biset functors. In this thesis, I focus on two biset functors: the Burnside functor and the functor of p-permutation modules. For the Burnside functor we ...
Gaussian random fields are widely used as building blocks for modeling stochastic processes. This paper is concerned with the efficient representation of d-point correlations for such fields, which in turn enables the representation of more general stochas ...
A natural extension of the makespan minimization problem on unrelated machines is to allow jobs to be partially processed by different machines while incurring an arbitrary setup time. In this paper we present increasingly stronger LP-relaxations for this ...
Building on advanced results on permutations, we show that it is possible to construct, for each irreducible representation of SU(N), an orthonormal basis labeled by the set of standard Young tableaux in which the matrix of the Heisenberg SU(N) model (the ...
