Sort by
Refine Your Search
-
Listed
-
Category
-
Program
-
Employer
- Nature Careers
- Institut Pasteur
- CEA
- European Magnetism Association EMA
- UNIVERSITE DE LILLE
- CNRS
- CONSERVATOIRE NAT. DES ARTS ET METIERS
- UNIVERSITE DE PAU
- UNIVERSITE DU MANS
- Université Côte d'Azur
- Université Savoie Mont Blanc
- ;
- BRGM
- CEA-Saclay
- Hult
- Inria, the French national research institute for the digital sciences
- Institut National Polytechnique de Toulouse
- Le Mans Université
- Nantes University
- UNIVERSITE LYON 3 (JEAN MOULIN)
- UNIVERSITY OF VIENNA
- University of Montpellier
- 12 more »
- « less
-
Field
-
and and experience in computational methods applied to structural biology. A strong publication track record.
-
various disciplines: computer scientists, mathematicians, biologists, chemists, engineers, physicists and clinicians from more than 50 countries currently work at the LCSB. We excel because we are truly
-
the EU Research Framework Programme? Not funded by a EU programme Is the Job related to staff position within a Research Infrastructure? No Offer Description Les maladies virales représentent un risque
-
molecular targets critical for developing new therapies for rare diseases, based on genetic data and biological system simulations. -Computational Drug Repurposing: Developing novel algorithms and databases
-
, copyrighted, or biased. By studying brain data recordings and building computational models that mimic real populations of neurons, the project aims to uncover active unlearning: how the brain learns
-
various disciplines: computer scientists, mathematicians, biologists, chemists, engineers, physicists and clinicians from more than 50 countries currently work at the LCSB. We excel because we are truly
-
well as computational modeling. The development and numerical implementation of novel methods has become a key issue in modern oncology, both in terms of understanding the biology of cancers and for medical oncology
-
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
-
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
-
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