Recherche

GT algodist - continuation: «Making synchronous algorithms efficiently self-stabilizing in arbitrary asynchronous environments», Frédéric Mazoit

Making synchronous algorithms efficiently self-stabilizing in arbitrary asynchronous environments (continued) This paper deals with the trade-off

A Hybrid AI system for fusion of object and context information: application to the rail line defect detection

Séminaire TAD A Hybrid AI system for fusion of object and context information: application to the rail line defect detection Alexey Zhukov A hybrid

Thèse Antoine Pirrone : « Apprentissage profond auto-supervisé de métriques : application à la prédiction d'assemblage de fragments de papyrus»

Antoine Pirrone soutiendra sa thèse intitulée : « Apprentissage profond auto-supervisé de métriques : application à la prédiction d'assemblage de

[gt.go] - "Smaller Universal Graphs for Caterpillars and Graphs of Bounded Path-Width (part 2)" by Cyril Gavoille

/Exposé en français/Talk in french / Transparents en anglais/English slides/ In this talk, I will given a rather simple construction of a graph U n

[MTV] Ocan Sankur (IRISA) - Timed Automata Verification and Synthesis via Finite Automata Learning

We present algorithms for model checking and controller synthesis of timed automata, seeing a timed automaton model as a parallel composition of a

[gt.go] - "Random embeddings of bounded degree trees with optimal spread" by Clément Legrand-Duchesne

/Exposé /Talk/ A seminal result of Komlos, Sarkozy and Szemeredi proves that for any \Delta and \alpha, any graph G with minimum degree (1/2+\alpha)n

[gt.go] - "A tight local algorithm for the minimum dominating set problem in > outerplanar graphs" and "Limiting crossing numbers" by Alexandra Wesole

/Exposé en anglais/Talk in english/ *A tight local algorithm for the minimum dominating set problem in outerplanar graphs* We present a deterministic

[M2F] Seminar Subin Pulari

On the Compressibility of Real Numbers: Certain insights using Fourier analytic methods Subin Pulari (post-doc M2F) Abstract: Measuring the

[MTV] - Théo Matricon (LaBRI) - Language Sharpening for Program Synthesis

The first question when deploying a program synthesis approach is the design of the target programming language, called domain-specific language (DSL)

[M2F] Sławek Lasota - University of Warsaw

**Orbit-finite linear programming** An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely