Recherche

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

[ICQ] Aabhas Gulati (IMT) Entanglement in the Dicke subspace

In this talk, I will discuss the entanglement properties of mixtures of Dicke states. These quantum states form an important subclass of bosonic

[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

[MTV] Mathieu Hilaire (LaBRI) - Serializability in Parametric Timed Automata, Resilience and Home-Space for WSTS

In the first half of the talk, I will talk about the EXPSPACE lower bound for PTA reachability developed during my phd thesis. Parametric timed

GT AlgoDist, «Trajectory visibility at first sight», Hussein Kazemi

Hussein Kazemi (LaBRI) Title: Trajectory visibility at first sight Abstract: Let P be a simple polygon with n vertices, and let two moving entities q

[gt.go] - "Tree-independence through distance to chordal graphs" by Fanny Hauser (LaBRI)

The tree-independence number of a graph is the analogue of treewidth where, instead of minimising the size of bags, we minimise the size of a stable

[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