Sort by
Refine Your Search
-
Listed
-
Employer
- Nature Careers
- CNRS
- IRIT, Université de Toulouse
- Inria, the French national research institute for the digital sciences
- American University of Paris;
- CEA
- IMT MINES ALES
- IRISA
- Institut National Polytechnique de Toulouse
- Institut Neel
- Laboratoire National de Métrologie et d'Essais - LNE
- NIMES UNIVERSITE
- The American University of Paris
- UNIVERSITY OF VIENNA
- Université Grenoble Alpes
- Université d'Orléans
- Université de Montpellier
- Université de Pau et des Pays de l'Adour
- Université de Technologie de Belfort-Montbéliard
- Université de Toulouse
- École nationale des ponts et chaussées
- 11 more »
- « less
-
Field
-
minimizing error and maximizing efficiency, is computationally challenging—no known polynomial-time algorithm exists to solve it optimally in all cases. Because of this complexity, researchers typically rely
-
work will be organized around the following areas: 1. Bee detection and tracking: Development of computer vision algorithms to identify and track each bee from high-resolution images, while
-
Université de Technologie de Belfort-Montbéliard | Belfort, Franche Comte | France | about 1 month ago
(formulation, algorithms, applications in structural mechanics), HPC computing, reduced-order modelling, machine learning, Vibrations and structural dynamics, architected materials, Additive manufacturing
-
p x∈R y∈Rp where F is the outer objective and f is the inner objective. Solving such problems is challenging due to the need to compute gradients through
-
candidates may be asked to teach: Introductory programming classes Core undergraduate CS classes such as: Human Computer Interaction, Database Applications, Algorithms and Data Structures, Software engineering
-
openness to interdisciplinary collaborations Expertise in some area of computer science such as computational complexity, algorithms, data structures, logic in computer science and AI, semantics, theory
-
suitable data models [CSC+23]. Objectives As far as the design of efficient numerical algorithms in an off-the-grid setting is concerned, the problem is challenging, since the optimization is defined in
-
on stochastic Riemannian optimization algorithms, these methods still suffer from limitations in computational complexity. The post-doctoral fellow will build upon this preliminary work to investigate
-
algorithms for dynamic structured data, with a particular focus on time sequences of graphs, graph signals, and time sequences on groups and manifolds. Special emphasis will be placed on non-parametric
-
École nationale des ponts et chaussées | Champs sur Marne, le de France | France | about 1 month ago
France Application Deadline 30 Nov 2025 - 23:59 (Europe/Paris) Type of Contract Temporary Job Status Full-time Offer Starting Date 1 Apr 2026 Is the job funded through the EU Research Framework Programme