Concept

Permutation group

Related publications (46)

Extended Formulations for Packing and Partitioning Orbitopes

We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in Kaibel and Pfetsch [Kaibel, V., M. E. Pfetsch. 2008. Packing and partitioning orbitopes. Math. Programming ...

2009

Product groups acting on manifolds

Nicolas Monod

We analyse volume-preserving actions of product groups on Riemannian manifolds. Under a natural spectral irreducibility assumption, we prove the following dichotomy: Either the action is measurably isometric, in which case there are at most two factors; or ...

2009

Polar Codes: Characterization of Exponent, Bounds, and Constructions

Rüdiger Urbanke, Satish Babu Korada, Eren Sasoglu

Polarization codes were recently introduced by Ar\i kan. They are explicit code constructions which achieve the capacity of arbitrary symmetric binary-input discrete memoryless channels (and even extensions thereof) under a low complexity successive decodi ...

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

Sorting signed permutations by inversions in O(nlogn) time

Bernard Moret, Yu Lin, Vaibhav Rajan, Krister Swenson

The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inv ...

Springer2009

Foncteurs de Mackey projectifs

This work deals with the study of projective Mackey functors. Mackey functors are algebraic structures with operations which behave like induction, restriction and conjugation in group representation theory. These objects have properties which generalize m ...

EPFL2008

Graph colouring approaches for a satellite range scheduling problem

Nicolas Zufferey, Patrick Amstutz, Philippe Giaccari

A goal of this paper is to efficiently adapt the best ingredients of the graph colouring techniques to an NP-hard satellite range scheduling problem, called MuRRSP. We propose two new heuristics for the MuRRSP, where as many jobs as possible have to be sch ...

2008

Automatic Analysis of Multimodal Group Actions in Meetings

Daniel Gatica-Perez, Samy Bengio, Guillaume Lathoud, Dong Zhang, Mark Barnard

This paper investigates the recognition of group actions in meetings. A statistical framework is proposed in which group actions result from the interactions of the individual participants. The group actions are modelled using different HMM-based approache ...

2004

Genomic distances under deletions and insertions

Bernard Moret, Krister Swenson

As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome evolves through insertions, deletions, and movements of genes along its chromo ...

2004

Multimodal Group Action Clustering in Meetings

Daniel Gatica-Perez, Samy Bengio, Guillaume Lathoud, Dong Zhang

We address the problem of clustering multimodal group actions in meetings using a two-layer HMM framework. Meetings are structured as sequences of group actions. Our approach aims at creating one cluster for each group action, where the number of group act ...

IDIAP2004

Multimodal Group Action Clustering in Meetings

Daniel Gatica-Perez, Samy Bengio, Guillaume Lathoud, Dong Zhang

2004

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.