Sort by
Refine Your Search
-
Listed
-
Category
-
Program
-
Employer
- CNRS
- Nature Careers
- Inria, the French national research institute for the digital sciences
- Aix-Marseille Université
- CEA
- Université Grenoble Alpes
- American University of Paris;
- Ecole Centrale de Lyon
- FRANCE ENERGIES MARINES
- IMT MINES ALES
- IRISA
- Institut National Polytechnique de Toulouse
- Institut Neel
- Institut Pasteur
- Institut of Mathematics of Marseille
- LE STUDIUM LOIRE VALLEY INSTITUTE FOR ADVANCED STUDIES
- Laboratoire de Physique des Interfaces et des Couches Minces (LPICM), UMR CNRS/École Polytechnique,
- Nantes Université
- The American University of Paris
- Télécom SudParis
- UNIVERSITY OF VIENNA
- Université Grenoble Alpes, laboratoire TIMC, équipe GMCAO
- Université Savoie Mont Blanc
- Université d'Orléans
- Université de Montpellier
- Université de Pau et des Pays de l'Adour
- Université de Technologie de Belfort-Montbéliard
- École Normale Supéireure
- École nationale des ponts et chaussées
- 19 more »
- « less
-
Field
-
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
-
9 Sep 2025 Job Information Organisation/Company CNRS Department Laboratoire d'analyse et d'architecture des systèmes Research Field Engineering Computer science Mathematics Researcher Profile First
-
Research Engineer in optimization and Design Space Exploration for Next-Generation Computing Systems H/F IN SUMMARY, WHAT DO WE OFFER YOU? We are looking for an Research Engineer in optimization and
-
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
-
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
-
) models. Little attention has been paid to other models like graph NNs (GNNs) or PCA. Among the few existing works in the literature, [2] proposes an FL algorithm to compute PCA in a DP fashion, but the
-
, sensor failures, or the aggregation of datasets from multiple sources. There is a rich literature on how to impute missing values, for example, considering the EM algorithm [Dempster et al., 1977], low