Concept

Groupe réductif

Publications associées (251)

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

Linear Manifold Approximation based on Differences of Tangents

Pascal Frossard, Sofia Karygianni

In this paper, we consider the problem of manifold approximation with affine subspaces. Our objective is to discover a set of low dimensional affine subspaces that represents manifold data accurately while preserving the manifold’s structure. For this purp ...

2011

Some remarks on orbit sets of unimodular rows

Jean Fasel

Let A be a d-dimensional smooth algebra over a perfect field of characteristic not 2. Let Um(n+1)(A)/En+1 (A) be the set of unimodular rows of length n + 1 up to elementary transformations. If n >= (d + 2)/2, it carries a natural structure of group as disc ...

2011

Group secret key agreement over state-dependent wireless broadcast channels

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

We consider a group of m trusted nodes that aim to create a shared secret key K, using a state-dependent wireless broadcast channel that exists from one of the honest nodes to the rest of the nodes including a passive eavesdropper Eve. All of the trusted n ...

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

Paper Interface Design for Classroom Orchestration

Pierre Dillenbourg, Frédéric Kaplan, Sébastien Cuendet, Quentin Bonnard

Designing computer systems for educational purpose is a difficult task. While many of them have been developed in the past, their use in classrooms is still scarce. We make the hypothesis that this is because those systems take into account the needs of in ...

2011

An Audio Visual Corpus for Emergent Leader Analysis

Daniel Gatica-Perez, Oya Aran, Dairazalia Sanchez Cortes

In this paper we discuss our experience designing and collecting a data corpus called ELEA (Emergent LEader Analysis), and describe the use of a light portable scenario to record small group meetings. The corpus was gathered with the aim of analyzing emerg ...

2011

Endotrivial modules for p-solvable groups

Jacques Thévenaz, Nadia Mazza

We determine the torsion subgroup of the group of endotrivial modules for a finite solvable group in characteristic p. We also prove that our result would hold for p-solvable groups, provided a conjecture can be proved about the case of p-nilpotent groups. ...

2011

Secure key exchange in wireless networks

Christina Fragouli, László Czap

We investigate the problem of exchanging a se- cret key within a group of wireless devices. In particular, we are interested in information theoretically secure key exchange schemes that enable honest nodes of a multi-hop network to establish a secret grou ...

2011

Triangle generation of finite exceptional groups of low rank

Claude Marion

Given a triple (p(1), p(2), p(3)) of primes, the object of this paper is the study of the space Hom(T-p1,T-p2,T-p3, G) of homomorphisms from the triangle group T-p1,T-p2,T-p3 to a finite simple exceptional group G of Lie type B-2(2), (2)G(2), G(2) or D-3(4 ...

Elsevier2011

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

Generalized Universality

Rachid Guerraoui

State machine replication reduces distributed to centralized computing. Any sequential service, modeled by a state machine, can be replicated over any number of processes and made highly available to all of them. At the heart of this fundamental reduction ...

Springer Berlin Heidelberg2011