Canal-U

Mon compte

Résultats de recherche

Nombre de programmes trouvés : 3262
Séminaires

le (56m35s)

A Model Digital Edition of the Mishnah

For too long, the great European projects for digital humanities were not on the same page as the American projects. This initiative aims at helping American and European researchers to collaborate in the field of digital literary studies, to share their knowledge and their methods, to share practices and common tools and to disseminate their works.   Thanks to an important funding of the Foundation A.W Mellon, the FMSH has been able to support, through this programme, collaborative actions between research institutions and American and European universities. The principal objective was to give an international visibility to digital philology, ...
Voir la vidéo
Label UNT Vidéocours

le (56m34s)

Convergences

Série de "zooms" transversaux qui permettent aux étudiants de faire une synthèse de leurs connaissances et de vérifier qu'ils ont acquis les concepts fondamentaux. Aide à la compréhension des concepts de bases et des techniques fondamentales.GénériqueÉmission conçue et préparée par Jacques VAUTHIER Centre de Télé-enseignement Universitaire Université Pierre et Marie Curie - Paris 6 Émission réalisée avec le soutien du Ministère de l'Education Nationale de la Recherche et des Technologies Direction de la Technologie et le concours de la Fédération Interuniversitaire d'Enseignement à Distance Production déléguée et exécutive Université Nancy 2 - VIDEOSCOP Université Paris 6 - PAVÉ Directeur de ...
Voir la vidéo
Conférences

le (56m28s)

Reasoning as a Social Activity

La sagesse collective : principes et mécanismesColloque des 22-23 mai 2008, organisé par l'Institut du Monde Contemporain du Collège de France, sous la direction du Professeur Jon Elster.Intervention de Dan Sperber et Hugo Mercier, CNRS, Institut Nicod, 23 mai 2008Some forms of collective opinion fixing or decision making – through polling or voting for instance – require little use of higher cognitive capacities on the part of most of the agents involved. Others forms, those involving debating in particular, require much more: agents have to reason in order to produce arguments and evaluate the arguments of others. Reasoning is generally ...
Voir la vidéo
Cours magistraux

le (56m22s)

Bubeck 7/9 - Some geometric aspects of randomized online decision making

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 in the mid-2000's due to many applications in the internet economy. This course focuses on a set of challenging conjectures around these models from the 1980's and 1990's. We present a unified approach based on a combination of convex optimization techniques together with powerful probabilistic tools, which will allow us to derive state of the art results in online learning, bandit optimization, as well as some classical online computing ...
Voir la vidéo
Conférences

le (56m22s)

Inférence à la meilleure explication en mathématiques : Concilier apriorité et révisabilité / Mathematical inference to the best explanation : Reconciling a priority and revisability.

... explication en mathématiques. Peut-on, en mathématiques, avoir des formes à priori d’inférence à la meilleure explication ? Peuvent-elles être à la fois à priori et révisables ? Marina Imocrante discusses the nature of mathematical inferences to the...
Voir la vidéo
Conférences

le (56m16s)

Reto Buzano - Minimal hypersurfaces with bounded index and bounded area

We study sequences of closed minimal hypersurfaces (in closed Riemannian manifolds) that have uniformly bounded index and area. In particular, we develop a bubbling result which yields a bound on the total curvature along the sequence. As a consequence, we obtain qualitative control on the topology of minimal hypersurfaces in terms of index and area. This is joint work with Ben Sharp.
Voir la vidéo
Cours magistraux

le (56m12s)

Tropp 6/9 - Random matrix theory and computational linear algebra

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 simple and practically useful. We begin with an introduction to matrix concentration inequalities, which are a powerful tool for analyzing structured random matrices. We use these ideas to study matrix approximations constructed via randomized sampling, such as the random features method. As a more sophisticated application, we present a complete treatment of a recent algorithm for solving graph Laplacian linear systems in near-linear time. Some references : 1. Tropp, "An introduction to ...
Voir la vidéo
Conférences

le (56m7s)

V. Gadre - Effective convergence of ergodic averages and cusp excursions of geodesics

Effective convergence of ergodic averages and cusp excursions of geodesics on moduli spacesWe survey some applications of effective convergence of ergodic averages to the analysis of cusp ex-cursions of typical geodesics on moduli spaces. This will cover Teichmuller geodesics, Weil-Peterssongeodesics and geodesics typical for harmonic measures arising from random walks on mapping class groups.
Voir la vidéo

 
FMSH
 
Facebook Twitter
Mon Compte