Jyoti Maggu (IIIT Delhi)

Supervised Transform Learning

Room 210 (ESIEE PARIS).

Abstract: Representation learning techniques have gained popularity over the years. Machine Learning community is well aware of several representation learning tools, viz. AutoEncoders, Deep belief networks, Convo...[more]

17-May-2018

Sagi Snir

Constructing the Microbial Tree of Life Using Quartet Based Approaches

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

Understanding the origin and history of life on Earth is among the most fundamental and challenging tasks in Biology.This history is usually described by a tree-like rel...[more]

27-Apr-2018

Fabien Durand

Décidabilité et suites morphiques

Bâtiment Lavoisier, salle LAV108

Abstract: Dans cet exposé nous présenterons des résultats anciens et nouveaux de décidabilité concernant les suites obtenues comme images de morphismes de points fixes d'endomorphismes, autrement appelées suites...[more]

10-Apr-2018

Joanna Ochremiak

Sum-of-Squares, Counting Logics and Graph Isomorphism

Bâtiment Lavoisier, salle LAV108

Abstract: The isomorphisms between two graphs can be described by the integral solutions of a system of linear equations and inequalities. We show that the Lasserre hierarchy of increasing...[more]

27-Mar-2018

Edouard Bonnet

Description :Max Clique in Disk and Ball Graphs

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

Abstract: The complexity of finding a largest clique in a disk intersection graph is a notorious open question in computational geometry. A polynomial algorithm is known since 1990 for un...[more]

20-Mar-2018

ESIEE Paris, école d’ingénieurs située au sein de la communauté d’universités et établissements Université ParisEst, recrute un enseignant-chercheur à haut potentiel en réseaux et sécurité. Ce recrutement s'effectue dans le contexte du développement de la filière en apprentissage « Réseaux et sécuri...[more]

16-Mar-2018

Eric Colin de Verdière

Approximating planar multicut

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

Let G be a graph and R a set of pairs of vertices, called pairs of terminals. A multicut is a set of edges of G whose removal disconnects each pair in R. Computing the minimum multicut is hard both...[more]

6-Mar-2018

Eunjung Kim

Description :Erdos-Posa Property of Chordless Cycles and its Applications

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

Abstract: A chordless cycle is a cycle of length at least 4 that has no chord. We prove that the class of all chordless cycles has the Erdos-Posa property, which re...[more]

6-Feb-2018

Christoph Dürr

Description :The triangle scheduling problem

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

Abstract: We introduce a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels. A me...[more]

30-Jan-2018

Rémi de Joannis de Verclos

Easily testable properties of dense graphs

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

Abstract: A graph of size n is ɛ-far from having a property P if one have to add or delete at least ɛn² edges of G to have a graph satisfying P. A graph property P is testable if f...[more]

23-Jan-2018