moteur de recherche

Archives

Les archives des événements LIGM

Séminaire Algo - Lama Tarsissi

Lama Tarsissi

First Steps in the Algorithmic Reconstruction of Digital Convex Sets

Bâtiment Lavoisier, salle 27? (à confirmer)

A quite remarkable family of discrete sets which has recently attracted the attention of the discrete geometry community is the family of (digitally) convex polyominoes, ...[more]


16-Oct-2018
Séminaire Algo - Julien Baste

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
Séminaire Algo - Shakhar Smorodinsky

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
Séminaire LRT - Prof. Boutaba

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
Séminaire A3SI - Fred Hamprecht

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
Séminaire Algo - Mathias Weller

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
Congrès joints RFIAP 2018 et CFPT 2018

Du 25 au 28 juin 2018, les associations AFRIF (Association Française pour la Reconnaissance et l'Interprétation des Formes), SFPT (Société Française de Photogrammétrie et de Télédétection) et le chapitre français de la société GRSS de l'IEEE organisent conjointement sur...[more]


25-Jun-2018
Séminaire A3SI+LRT - Jean-Francois Baffier

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
School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects

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
Séminaire A3SI - Alexei Efros

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
Displaying results 51 to 60 out of 393