Julien Baste

Hitting minors on bounded treewidth graphs

Bâtiment Lavoisier, salle 27

For a fixed collection of graphs F, the F-DELETION problem consists in, given a graph G and an integer k, decide whether there exists S, subset of V(G), with |S| <= k such that G-S does not contain any of the ...[more]

9-Oct-2018

Shakhar Smorodinsky

Conflict-Free colorings

Bâtiment Rabelais, salle 34

There are few generalizations of the classical graph coloring notion to arbitrary hypergraphs. One such generalization is the notion of conflict-free coloring. This notion originated in the context of frequency assignmen...[more]

5-Oct-2018

Prof. Boutaba, University of Waterloo (Canada)

The “Cloud” to “Things” Continuum

Room 5257 (ESIEE-Paris)

Back in 2011, we introduced the concept of a multi-tier cloud as part of the “Smart Applications on Virtualized Infrastructure (SAVI)” NSERC Strategic Network Project. SAVI extends the traditi...[more]

3-Jul-2018

Fred Hamprecht (Heidelberg University)

Watershed: how to learn it end-to-end, and how to use it in graph partitioning

Room 3005 (ESIEE PARIS)

Abstract: In a first part, I will sketch how to realize an end-to-end learning of a segmentation pipeline involving a watershed computation [Wolf et al., &...[more]

2-Jul-2018

Mathias Weller

Tree Containment With Soft Polytomies

Bâtiment Lavoisier, salle LAV108

The Tree Containment problem has many important applications in the study of evolutionary history. Given a phylogenetic network N and a phylogenetic tree T whose leaves are labeled by a set of taxa, it asks if N...[more]

26-Jun-2018

Jean-Francois Baffier (Tokyo Institute of Technology)

Study of compressed stack algorithms in limited memory environment

Room 260 (ESIEE PARIS)

Abstract: The need to run algorithms on limited-memory devices motivated our consideration for data structure in the settings where there is only a limit...[more]

22-Jun-2018

This one-week school, held at Institut Henri Poincaré in the heartof Paris, is devoted to low-dimensional geometry and topology, fromboth the viewpoints of mathematicians and computer scientists.  Itis aimed at graduate students and researchers in mathematics andcomputer science interested in g...[more]

18-Jun-2018

Alexei Efros (UC Berkeley)

Self-supervision, Meta-supervision, Curiosity: Making Computers Study Harder

Seminar room B412 of the IMAGINE group (ENPC - Bat. Coriolis)

Abstract: Computer vision has made impressive gains through the use of deep learning models, trained with large-scale labeled data....[more]

29-May-2018

Boris Bukh (Carnegie Mellon University)

Mini-survey of additive combinatorics

Bâtiment Lavoisier, salle LAV108

Abstract: Additive combinatorics studies how sets behave under the basicarithmetic operations (addition, multiplication). The far-rangingapplicability of additive combinatorics throughou...[more]

29-May-2018

François Malgouyres (Institut de Mathématiques de Toulouse)

Multilinear compressive sensing and an application to convolutional linear networks

Seminar room B412 of the IMAGINE group (ENPC - Bat. Coriolis)

Abstract: We study a deep linear network expressed under the form of a matrix factorization...[more]

24-May-2018