Search
Algebraic Complexity – CompA
The «P=NP ?« problem is widely recognized as the most important open problem in the theory of computing. Given the difficulty of the problem, several algebraic versions of the P versus NP problem were proposed. The hope is that these algebraic problems will be easier to tackle than the original one
Optimization methods for the integrated study of complex decisional problems – ATHENA
The optimization of complex decision-making process is studied in Operations Research and mathematical optimization for many years. Often the problems addressed are the result of an implicit decomposition, which was made in view of the nature of the problems and the obvious complexity of treating th
Categories, Homotopy and Rewriting – CATHRE
The Cathre project is rooted in the works of Squier, Anick and others on homological properties of presentations of monoids and algebras. Squier showed in particular that if a monoid M can be presented by a finite, confluent and terminating rewriting system, then its third integral homology group H_
Advanced Multilateral Argumentation for Deliberation – AMANDE
Representation of arguments, automating argumentative reasoning, regulating multiparty debates - survey on aggregation of multiagent systems - survey on gradual semantics - new approaches for judgement aggregation, based on vote support - new approaches for gradual argumentation semantics - new
Dynamics of gcd algorithms: an Algorithmic, Analytic, Arithmetic, and Symbolic approach – DynA3S
The computation of the gcd is one of the most basic operations in computational number theory. If the (fast) computation of the gcd of two integers has been widely explored, the situation is more contrasted when considering at least three entries. The computation of the gcd is the main problem we w
Similarity of Locally Structured Data in Computer Vision – SoLStiCe
SoLSTiCe is a fundamental research project which aims at designing new models and tools for representing and managing images and videos in order to, e.g., retrieve images or videos which are similar to a query image or video; recognize objects in images; track objects in videos; or detect typical ac
Stochastic Models: Scalable Model Checking – Stoch-MC
The aim of our research project Stoch-MC is to develop scalable model checking techniques that can handle large stochastic systems and give sure answers. Large stochastic systems arise naturally in many different contexts, from networks to system biology. We will demonstrate the techniques that we w
Real-time Visual Reconstruction by Mixing Multiple Depth and Color Cameras – MIXCAM
The objective of MIXCAM is to develop novel scientific concepts and associated methods and software for producing live 3D content for glass-free multi-view 3D displays. MIXCAM will combine (i) theoretical principles underlying computational stereopsis, (ii) multiple-camera reconstruction methodologi
African Languages in the Field : speech Fundamentals and Automation. – ALFFA
The number of languages spoken in Africa ranges from 1 000 to 2500, according to estimates and definitions. Monolingual States do not really exist on this continent since languages cross borders. The number of languages varies from 2 or 3, in Burundi and Rwanda, to more than 400 in Nigeria. Multilin
Faust Environment Everyware: an ubiquitous solution for multiplatform and portable numerical audio processing – FEEVER
Music has been transcending societies and eras. In our digital world, from portable MP3 players to radio streaming to Surround Sound-equipped movie theaters, music and more generally audio processing is a life-enhancing practice that impacts everyone everywhere in evermore personalized manners. Yet,
Forbidden Structures – Stint
Induced subgraphs play a central role in both structural and algorithmic graph theory. A graph H is an induced subgraph of a graph G if one can delete vertices of G to obtain H. This is the strongest notion of subgraph, hence being H-free (that is not containing H as an induced subgraph) is not a ve