Recherche

Akka Zemari (LaBRI) Title: (Online) Continual Learning Abstract: In real-world supervised learning, training data is often unavailable simultaneously

Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States

A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture

Le Graduate Program Numerics vous invite à son séminaire sur les enjeux sociétaux & la culture scientifique en lien avec le numérique. Deuxième séance
Le Graduate Program Numerics vous invite à son séminaire sur les enjeux sociétaux & la culture scientifique en lien avec le numérique. Deuxième séance

The talk is in two parts. In the first part, we prove a lower bound on the scrambling speed of a random quantum circuit. We give three applications of

Ultrametrics are representations of data that emphasize hierarchical properties and are widely used in data visualization and clustering. In the

The well-known Nerode equivalence for finite words plays a fundamental role in our understanding of the class of regular languages. The equivalence

A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture

Title: No more Boyer-Moore ! Quite old algorithmic string matching stuff but not so well known Speaker: Mathieu Raffinot, CR CNRS, équipe BKB, LaBRI