Recherche

[DART] R4

Wolfgang-OP: A Robust Humanoid Robot Platform for Research and Competitions Jasper Güldenstein Visio: https://u-bordeaux-fr.zoom.us/j/83483228567

[ICQ] Preksha Naik (Caltech) Testing Classical Properties from Quantum Data

Many classes of Boolean functions can be tested much faster than they can be learned. However, this speedup tends to rely on query access to the

[gt.go] - "Planarity and dimension" par Jędrzej Hodor

Exposé en anglais / Talk in english There are various parameters used to measure the complexity of posets (partially ordered sets), and many

[ICQ] Baptiste Anselme Martin (Eviden) Hybrid quantum-classical algorithms using tensor networks

Tensor networks (TNs) offer powerful algorithms for simulating quantum systems, but struggle to represent states with high entanglement. In contrast

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

[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

[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