Mathématiques et informatique
Cours
Présentation Sophie Abélanet IPMC, Sophia-Antipolis
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
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
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
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
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
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
Conférence
Modern programming languages such as Java, Scala, and Rust are examples of concurrent higher-order imperative programming languages.
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
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
Tout ce que vous avez toujours voulu savoir sur le standard IEEE 754.
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 «
Runtime monitoring/verification is a lightweight technique that complements other verification methods in a multi-pronged approach towards ensuring software correctness. The technique poses novel
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?
Vidéo pédagogique
Christian Mercat Université de Lyon; Université Claude Bernard Lyon 1; S2HEP (EA4148) directeur de l’Institut de recherche sur l’enseignement des mathématiques (IREM). Avec la participation de
We have seen that a genomic textcan be indeed a very long sequence of characters. And to interpret this sequence of characters, we will need to use computers. Using computers means writing program.
Welcome to this introduction to bioinformatics. We will speak of genomes and algorithms. More specifically, we will see how genetic information can be analysed by algorithms. In these five weeks to
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
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
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
In this session, I will present a variant of the CFS signature scheme called parallel-CFS. We start from a simple question: what happens if you try to use two different hash functions and compute
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