Sort by
Refine Your Search
-
Your Job: Develop methods and workflows to construct robust co-regulation networks from large single-cell and spatial transcriptomics datasets Integrate ontologies and metadata (e.g., tissue, cell
-
, extending them with physics-based approaches, and adapting existing physics-integrated neural network approaches for stress prediction in arterial walls and plaque. Another part of the project is exploring
-
surrogates or approximators, such as random forests or shallow neural networks, trained to mimic the outputs of the original computations at a fraction of the cost. This hybridization aims not only
-
reports Your Profile: Genuine interest in data science and one or more of its application domains: life and medical sciences, earth sciences, energy systems, or material sciences University degree (M.Sc
-
Your Job: Energy systems engineering heavily relies on efficient numerical algorithms. In this HDS-LEE project, we will use machine learning (ML) along with data from previously solved problem
-
19 Dec 2025 Job Information Organisation/Company Karlsruhe Institute of Technology Department KIT Center MathSEE Research Field All Biological sciences Chemistry Computer science Mathematics
-
or spike correlation patterns limited to local neural circuits or span across brain regions? Set up a network model to reproduce the main results and provide potential neuronal mechanisms. Existing
-
is far beyond in-situ observational networks. However, the accuracy of satellite retrievals depends on several assumptions leading to biased observations. The aim of the PhD-project is to overcome
-
an international, interdisciplinary research team Familiarity with Bayesian thinking is desirable No prior biological experience is required; curiosity for life science questions and willingness to collaborate with
-
software openly with documentation. Your Profile: A Masters degree with a strong academic background in mathematics, computer science and earth science/engineering, or a related field Proficiency in at least