Search
Algorithmic theory of new data models – AlgoriDAM
The main goal is to study fundamental algorithmic and structural problems in theoretical computer science in modern computational and data models, such as streaming, online, multistage, or incorporating uncertainty or the necessity for testing. One may note in particular one PhD thesis, by Simon Mau
Continous Image PRocESSIng: models and algorithms – CIPRESSI
One of the great challenges of imaging sciences is to recover high resolution images from incomplete and possibly noisy measurements. A common practice when tackling such inverse problems is to define a pixel grid on which to reconstruct an image that accounts for the observations, for instance by m
Probabilistic program semantics – PPS
Probabilities are essential in Computer Science. Many algorithms use probabilistic choices for efficiency or convenience. Recently, probabilistic programming, and more specifically, functional probabilistic programming, has shown crucial in various works in Bayesian inference and Machine Learning. S
Adaptive Learning for Interactive Agents and Systems – ALIAS
A critical challenge in the current digital era is the need for real-time decision-making in complex systems, often based on data that arrive at very high volumes: traffic routing in packet-switched networks, online matching markets (taxi-hailing apps, micro-labor markets, etc.), generative adversar
Efficient Certified Algorithms for Robot Motion Planning – ECARP
Recently, several breakthroughs in computer algebra opened new perspectives to better tackle problems in semialgebraic geometry such as connectivity queries and determination of connected components of semialgebraic sets. An important application to this is the motion planning of robots. In this
Efficient Query answering Under UpdateS – EQUUS
Efficient query answering, i.e., computing the answer to a query on a given database, is one of the core problems studied in database theory. It is a very fruitful area of research with a long history and many new results and directions, e.g. efficient algorithms for aggregation, enumeration of quer
Digraphs – DIGRAPHS
The objectives of the project is to make some advances on digraph theory in order to get a better understanding of important aspects of digraphs and to have more insight on the differ- ences and the similarities between graphs and digraphs. We worked on some digraphs problems and made a number of ad
Enumerative combinative: interactions with algebra, number theory and physics – COMBINE
Enumerative combinatorics is the area of combinatorics that aims at finding the number of ways that certain patterns can be formed. The problem of discovering an enumeration formula frequently involves deriving a recurrence relation or generating function, and using this to arrive at the desired for
Dynamic Versatile Semantics – DYVERSE
Denotational semantics proposes a methodology to reason formally, and compositionally, on programs and their behaviour. It does so by embedding programs in an appropriate mathematical universe, allowing one to state and prove the correctness of a program as a mathematical theorem. But which mathe
Cryptography, Isogenies and Abelian varieties Overwhelming – CIAO
The aim of the CIAO project is to study the security and improve the efficiency of the SIDH (supersingular isogenies Diffie Helmann) protocol, which is one of the post-quantum cryptographic project submitted to NIST, which passed the first round selection. The project include all aspects of SID
Multiscale estimation and Interface detection – Multisc-In
This project is devoted to innovative image processing tools relying both on optimization and multiresolution analysis in order to provide a new paradigm for the interface detection on large scale data. This project essentially relies on: (Obj 1) a deep theoretical study of the discrete Mumford-Sha
Computational Aspects of Combinatorial Theorems – ACTC
Reverse mathematics are a foundational program at the intersection of computability theory and proof theory, whose aim is to determine the computable strength of axioms necessary to prove ordinary mathematics. This program enabled to reveal a structural phenomenon of mathematics from a computational
Probabilistic Epistemic Logic Applied to Privacy – PRELAP
Estimating privacy exposure implies being able to 1) model knowledge an attacker can obtain, and 2) determine what he can infer from it. Logical and computational methods are prime candidates to do it. To formally verify a property, logical methods necessitate to design bespoke logics and use them t
Algorithms for Multi-Dimensional Data via Sketches – ADDS
One key in effectively addressing these challenges is through the notion of sketches: extract a small subset---ideally constant-sized subset---of the input data that captures, approximately with respect to a given parameter epsilon, key aspects of the entire data. Given a family of optimization pro
Estimation and control of open quantum systems – Q-COAST
Quantum control attempts to apply and extend the principles already used for classical control systems to the quantum domain. We hope to establish a control theory specifically dedicated to the regulation of quantum systems. This proposal addresses some key issues related to the control of open qua
Distributed adaptation and learning over graph signals – DARLING
Over the last 5 years, there has been a major and persistent interest for megadata processing, echoing a radical transformation of our information societies. Many applications involving megadata are structured by a network and require real-time actions due to their time-sensitive nature. The monitor
Analysis and Separation of Complex signals: Exploiting the Time-frequency structure – ASCETE
ASCETE is a methodological project whose objective is to focus on the development of adpative methods to decompose complex non stationary signals in a small number of physically significant components. The emphasis will be put on reassignment approaches, and we will seek to circumvent some of their
Observer Design for Infinite dimensional SyStEm – ODISSE
Methodologically, the ODISSE project is at the crossroads of inverse problems for partial differential equations (PDE) and observer theory. These two disciplines have a long and rich history of interactions between them and their overlap is becoming more and more important. The ODISSE project propos
Complexity of simple discrete systems – C_SyDiSi
C_SyDiSi project aims to study the frontier of complexity in simple discrete system. To do this, we take a formal transversal approach using various of simple computational systems. Starting from the broad study of "traces" (seen as one dimensional words) of these systems, we shall give birth to