Concept

Groupe fini

Publications associées (284)

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.

Connectez-vous pour utiliser Chat avec Graph Search

Compute-and-Forward: Harnessing Interference Through Structured Codes

Michael Christoph Gastpar

Abstract—Interference is usually viewed as an obstacle to communication in wireless networks. This paper proposes a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network. The key idea ...

Institute of Electrical and Electronics Engineers2011

Concept of modular flexure-based mechanisms for ultra-high precision robot design

Reymond Clavel, Murielle Richard

This paper introduces a new concept of modular flexure-based mechanisms to design industrial ultra-high precision robots, which aims at significantly reducing both the complexity of their design and their development time. This modular concept can be consi ...

2011

Concept of modular flexure-based mechanisms for ultra-high precision robot design

Reymond Clavel, Murielle Richard

2011

Decomposing locally compact groups into simple pieces

Nicolas Monod

We present a contribution to the structure theory of locally compact groups. The emphasis is put on compactly generated locally compact groups which admit no infinite discrete quotient. It is shown that such a group possesses a characteristic cocompact sub ...

Cambridge University Press2011

Coupling molecular dynamics with finite elements. Projective methods issues at finite temperature

Jean-François Molinari, Guillaume Anciaux, Srinivasa Babu Ramisetti

In the context of coupling methods that match molecular dynamics with finite elements, we focus on the finite temperature and heat rates treatment done by Bridging Domain approaches. The energy dissipation occurring due to the projection of the fine scale ...

2011

Free-surface fluid dynamics on moving domains

Thomas Zimmermann, Matthias Preisig

This paper presents a Lagrangian approach for the simulation of two-dimensional free-surface flows along with a systematic validation. Fluid-flow is traditionally modeled using an Eulerian description in association with finite differences and, more recent ...

2011

Verification of consensus algorithms using satisfiability solving

André Schiper

Consensus is at the heart of fault-tolerant distributed computing systems. Much research has been devoted to developing algorithms for this particular problem. This paper presents a semi-automatic verification approach for asynchronous consensus algorithms ...

Springer Verlag2011

Exponential Pattern Retrieval Capacity with Non-Binary Associative Memory

Mohammad Amin Shokrollahi, Krishna Kumar, Amir Hesam Salavati

We consider the problem of neural association for a network of non-binary neurons. Here, the task is to recall a previously memorized pattern from its noisy version using a network of neurons whose states assume values from a finite number of non-negative ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

The primitive idempotents of the p-permutation ring

Jacques Thévenaz, Serge Bouc

Let G be a finite group, let p be a prime number, and let K be a field of characteristic 0 and k be a field of characteristic p, both large enough. In this note, we state explicit formulae for the primitive idempotents of the ring of p-permutation kG-modul ...

Elsevier2010

Tensor Products of Weil Modules

Alex Monnard

The aim of this work is to understand the decomposition, in irreducible modules, of tensor products of Weil modules for Sp2n(3). To do this, we begin by computing the Weil modules for Sp4(3), Sp6(3) and Sp8(3) in order to understand how tensor products dec ...

2010