Mathématiques et informatique

Cours

cut.mkv
Cours
01:06:03
SageMath
Gourgoulhon
Éric

Éric Gourgoulhon présente le logiciel libre SageMath au cours de ce café.

Tropp 8/9 - Random matrix theory and computational linear algebra
Cours
01:24:40
Tropp 8/9 - Random matrix theory and computational linear algebra
Tropp
Joel Aaron

This course treats some contemporary algorithms from computational linear algebra that involve random matrices. Rather than surveying the entire field, we focus on a few algorithms that are both

Tropp 9/9 - Random matrix theory and computational linear algebra
Cours
00:40:59
Tropp 9/9 - Random matrix theory and computational linear algebra
Tropp
Joel Aaron

This course treats some contemporary algorithms from computational linear algebra that involve random matrices. Rather than surveying the entire field, we focus on a few algorithms that are both

Tropp 6/9 - Random matrix theory and computational linear algebra
Cours
00:56:11
Tropp 6/9 - Random matrix theory and computational linear algebra
Tropp
Joel Aaron

This course treats some contemporary algorithms from computational linear algebra that involve random matrices. Rather than surveying the entire field, we focus on a few algorithms that are both

Bubeck 8/9 - Some geometric aspects of randomized online decision making
Cours
00:49:23
Bubeck 8/9 - Some geometric aspects of randomized online decision making
Bubeck
Sébastien

This course is concerned with some of the canonical non-stochastic models of online decision making. These models have their origin in works from the 1950's and 1960's, and went through a resurgence

Bubeck 9/9 - Some geometric aspects of randomized online decision making
Cours
00:57:02
Bubeck 9/9 - Some geometric aspects of randomized online decision making
Bubeck
Sébastien

This course is concerned with some of the canonical non-stochastic models of online decision making. These models have their origin in works from the 1950's and 1960's, and went through a resurgence

Cours
Tropp 7/9 - Random matrix theory and computational linear algebra
Tropp
Joel Aaron

This course treats some contemporary algorithms from computational linear algebra that involve random matrices. Rather than surveying the entire field, we focus on a few algorithms that are both

Voir plus

Conférence

Vaudor_vignette
Conférence
01:12:18
Glitter makes SPARQL : glitter, un package R pour explorer et collecter des données du web sémantiq…
Vaudor
Lise

La collecte de données du web sémantique, qui sont formalisées selon le modèle RDF, nécessite l’élaboration de requêtes dans le langage dédié SPARQL. Ce langage, qui est aux données du web sémantique

alamercery_vignette
Conférence
01:43:58
L’interopérabilité sémantique au service de la réutilisation des données SHS : OntoME et le projet …
Alamercery
Vincent
Beretta
Francesco

Nous avons tous des vieux fichiers au fond d’un disque dur comportant des données plus ou moins structurées de l’époque héroïque où les chercheurs en sciences humaines utilisaient vaillamment des

cut.mkv
Conférence
01:02:44
Norme IEEE-754
Zimmermann
Paul

Tout ce que vous avez toujours voulu savoir sur le standard IEEE 754.

Présentation du CEREQ et focus sur deux enquêtes: L'enquête "Génération" et "DEFIS"- PUD-AMU
Conférence
02:18:03
Présentation du CEREQ et focus sur deux enquêtes: L'enquête "Génération" et "DEFIS"- PUD-AMU
Jugnot
Stéphane
Lambert
Marion
Molinari
Mickaële
Sigot
Jean-Claude

Intervention de Stéphane Jugnot, statisticien, à l’occasion de la semaine DATA SHS 2020 organisée par la plateforme universitaire de données (PUD) – Progedo. Cette intervention présente les enquêtes «

Zdeborová - Loss landscape and behaviour of algorithms in the spiked matrix-tensor model
Conférence
00:49:52
Zdeborová - Loss landscape and behaviour of algorithms in the spiked matrix-tensor model
Zdeborová
Lenka

A key question of current interest is: How are properties of optimization and sampling algorithms influenced by the properties of the loss function in noisy high-dimensional non-convex settings?

Voir plus

Vidéo pédagogique

5.7. The Fast Syndrome-Based (FSB) Hash Function
Vidéo pédagogique
00:08:21
5.7. The Fast Syndrome-Based (FSB) Hash Function
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In the last session of this week, we will have a look at the FSB Hash Function which is built using the one-way function we saw in the previous session. What are the requirements for a

5.5. Stern’s Zero-Knowledge Identification Scheme
Vidéo pédagogique
00:07:11
5.5. Stern’s Zero-Knowledge Identification Scheme
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this session, we are going to have a look at Stern’s Zero-Knowledge Identification Scheme. So, what is a Zero-Knowledge Identification Scheme? An identification scheme allows a prover to prove

5.6. An Efficient Provably Secure One-Way Function
Vidéo pédagogique
00:05:20
5.6. An Efficient Provably Secure One-Way Function
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this session, we are going to see how to build an efficient provably secure one-way function from coding theory. As you know, a one-way function is a function which is simple to evaluate and

5.3. Attacks against the CFS Scheme
Vidéo pédagogique
00:04:51
5.3. Attacks against the CFS Scheme
Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this session, we will have a look at the attacks against the CFS signature scheme. As for public-key encryption, there are two kinds of attacks against signature schemes. First kind of attack is

Voir plus