Vincent Cohen-Addad

On the Local Structure of Stable Clustering Instances

Salle de séminaire (4B05R) - Bâtiment Copernic

Abstract: On the Local Structure of Stable Clustering Instances We study the classic k-median and k-means clustering objectives in the beyond-worst-case scenario. We consider t...[more]

21-Nov-2017

Eric Fusy

Combinatorics and applications of Schnyder woods

Salle de séminaire (4B05R) - Bâtiment Copernic

Schnyder woods are combinatorial structures on planar triangulations (maximal planar graphs embedded on the sphere) that can be formulated as a certain partition of the edges into 3 spanning ...[more]

14-Nov-2017

Arnau Padrol

On the extension complexity of polytopes

Salle de séminaire (4B05R) - Bâtiment Copernic

Abstract: The extension complexity of a polytope is the minimal number of facets of a polytope that can be linearly projected onto it. This apparently simple combinatorial geometry problem has bee...[more]

7-Nov-2017

Solon Pissis

Searching in Uncertain Texts

Salle de séminaire (4B05R) - Bâtiment Copernic

Pattern matching is a fundamental problem in theoretical computer science. Apart from its theoretical interest, it has many applications in other areas where textual data representations are used: computation...[more]

24-Oct-2017

Patricia Bouyer-Decitre

Average-energy games

Salle de séminaire (4B05R) - Bâtiment Copernic

Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings includ...[more]

17-Oct-2017

Atelier D’Ada Lovelace à Valérie Beaudouin. Femmes et numérique : Une chance pour la visibilité ?

Atelier organisé par Caroline Trotot, Philippe Gambette et Virginie Tahar, le 17 octobre 2017 à l'auditorium de la bibliothèque Georges Perec de l'UPEM, de 14h à 17h30

Plus d'informations sur&nbs...[more]

17-Oct-2017

Xavier Goaoc

Fonctions de pulvérisation d'hypergraphes (géométriques) / Shatter functions of (geometric) hypergraphs

Salle de séminaire (4B05R) - Bâtiment Copernic

En géométrie discrète et algorithmique, la complexité d'une famille d'ensemble est souvent étudiée au travers de sa fonction de pulvé...[more]

10-Oct-2017

Vincent Jugé

Courcelle's theorem made dynamic

Salle de séminaire (4B05R) - Bâtiment Copernic

Dynamic complexity is concerned with the complexity of updating a solution to a problem when its input changes. A typical example is as follows: given an directed graph G and two pointed vertices s and t,...[more]

3-Oct-2017

Rémi Forax

On implementing data structures pattern matching in Java

Salle de séminaire (4B05R) - Bâtiment Copernic

In the magic wonderland of the unicorns, implementing the pattern matching in a language like Java that already provides a mechanism to check the class of a value at runtime (instanc...[more]

26-Sep-2017

Jeudi 21 septembre 2017 - 9h

Lieu : ESIEE Paris, Amphithéâtre 160

Séminaire Jean Luc Gaudiot

Professeur Université de California, Irvine, USA - Président IEEE Computer Society

Thématique du séminaire :

Informatique, Parallélisme et Architectures

Conférenciers invités :

Pr. Yves Robert, E...[more]

21-Sep-2017