Sort by
Refine Your Search
-
the research group Bioinformatics and Computational Biology headed by Ivo Hofacker. Our team works on the development of algorithms and methods for problems in Computational Chemistry, Systems Chemistry, and
-
at the intersection of statistics, machine learning, data analytics and modern AI algorithms. This includes, in particular, statistics for high-dimensional and complex data, stochastic optimization
-
or a closely related field. • You have experience in matrix algorithms, data compression, parallel computing, optimization of advanced applications on parallel and distributed systems. • An excellent
-
partners, one of them Infineon. The PhD candidate will be working on computer vision algorithms for head pose tracking. The tasks will be: Independent research on topics in 3D computer vision and machine
-
. These are your qualifications: Must-haves: • Completed doctoral/PhD studies in Computer Science or a closely related field. • You have experience in matrix algorithms, data compression, parallel computing
-
-driven systems such as chatbots, recommender algorithms, or generative AI. The position focuses on how communicative processes are shaped by and shape these technologies. The tenure track professorship is
-
or a closely related field. • You have experience in matrix algorithms, data compression, parallel computing, optimization of advanced applications on parallel and distributed systems
-
research for digital security and is a pioneer in developing highly innovative concepts, algorithms and systems for anomaly detection, cyber threat intelligence, penetration testing and cryptography. Through
-
stellar population models applied to state-of- the-art spectroscopy requires novel optimisation algorithms and efficient programming. • You can show a proven track record in object-oriented programming as
-
working in the research group “Theory and Applications of Algorithms” at the Faculty of Computer Science. The position is limited to six months and is planned to be filled from 01.10.2025. Your future tasks