60 parallel-processing-bioinformatics PhD scholarships at Technical University of Munich
Sort by
Refine Your Search
-
working on NLP for medical applications (see German version below / siehe unten für Deutsche Version) . Your Responsibilities Conduct applied research at the intersection of Natural Language Processing (NLP
-
under civil law in Freising, is a research institution of the Leibniz Association that combines methods of biomolecular basic research with analysis methods of bioinformatics and analytical high
-
disciplines. • Previous experience in microbiology/bioinformatics/bacterial genetics would be desirable. • Knowledge of a scripting language and R is a plus. • Excellent English communication skills (written
-
, metabolomics, and precision health YOUR PROFILE Completed university degree (Master’s or equivalent) in a scientific or technical field such as Physics, Biotechnology, Bioinformatics, Mathematics, Statistics
-
paid PhD position in the area of Natural Language Processing starting as soon as possible. Your responsibilities Research & development projects in the area of NLU and NLG Contribution to teaching on
-
08.09.2021, Wissenschaftliches Personal The Professorship of Machine Learning at the Department of Electrical and Computer Engineering at TUM has an open position for a doctoral researcher (TV-L E13
-
improve industrial processes by establishing a thorough understanding of the materials at different length- and time scales. Your project Milk protein concentrates (MPC) are dairy proteins which
-
. The group’s work in this area has led to best paper awards at PacificVis and Graph Drawing, with recent publications in IEEE Transactions on Visualization and Computer Graphics and Computer Graphics Forum
-
are unfortunately unable to return your application documents once the procedure has been completed. As part of your application for a position at the Technical University of Munich (TUM), you will be submitting per
-
13.01.2020, Wissenschaftliches Personal PhD position at the Chair of Algorithms and Complexity. Candidate shall work on approximation algorithms for scheduling problems in parallel and distributed