Probabilités et statistiques

Cours/Séminaire

Tropp 9/9 - Random matrix theory and computational linear algebra
Cours/Séminaire
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 8/9 - Random matrix theory and computational linear algebra
Cours/Séminaire
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 6/9 - Random matrix theory and computational linear algebra
Cours/Séminaire
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

Cours/Séminaire
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

Tropp 5/9 - Random matrix theory and computational linear algebra
Cours/Séminaire
01:01:43
Tropp 5/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

Massoulié - Planting trees in graphs, and finding them back
Conférence
00:41:32
Massoulié - Planting trees in graphs, and finding them back
Massoulié
Laurent

In this talk we  consider detection and reconstruction of planted structures in Erdős-Rényi random graphs. For planted line graphs, we establish the following phase diagram. In a low density region

Verzelen - Clustering with the relaxed K-means
Conférence
00:42:02
Verzelen - Clustering with the relaxed K-means
Verzelen
Nicolas

This talk is devoted to clustering problems. It amounts to partitionning a set of given points or the nodes of a given graph, in such a way that the groups are as homogeneous as possible. After

Klopp - Sparse Network Estimation
Conférence
00:39:33
Klopp - Sparse Network Estimation
Klopp
Olga

Inhomogeneous random graph models encompass many network models such as stochastic block models and latent position models. We consider the problem of the statistical estimation of the matrix of

Voir plus

Documentaire

KEZAKO : Pourquoi la tartine tombe toujours du coté beurré ?
Documentaire
00:04:00
KEZAKO : Pourquoi la tartine tombe toujours du coté beurré ?
Beaugeois
Maxime
Hennequin
Daniel
Deltombe
Damien

Kezako, la série documentaire qui répond à vos questions de science, aborde cette fois-ci la question "Pourquoi la tartine tombe toujours du coté beurré ?".  N'hesitez pas à réagir ou à oser

KEZAKO : Pourquoi faut-il diminuer la vitesse pour limiter les embouteillages ?
Documentaire
00:03:39
KEZAKO : Pourquoi faut-il diminuer la vitesse pour limiter les embouteillages ?
Beaugeois
Maxime
Hennequin
Daniel
Deltombe
Damien

Kezako, la série documentaire qui répond à vos questions de sciences traite de la question : "Pourquoi faut-il diminuer la vitesse pour limiter les embouteillages ?". N'hesitez pas à réagir et à poser

Vidéo pédagogique

TAM: sem 9 test du chi deux
Vidéo pédagogique
00:02:00
TAM: sem 9 test du chi deux

sem 9 test du chi deux

Voir plus