Research Departments Algorithms and Complexity Teaching Theory of Distributed Systems Theory of Distributed Systems Advanced Course, 2+2 Basic Information Lectures: Thursday, 10:15 - 12:00, E1.4 024 Lecturer: [...] memory, synchrony vs. asynchrony, fault-tolerance, and congestion. The focus lies on key concepts, algorithmic ideas, and mathematical analysis. Despite some overlap in topics, the angle is very different from [...] issues affect which problems can be solved and at which cost. On the way, surprising and elegant algorithms will surface alongside the principles guiding their design. Schedule Date Topic Exercise Sheet
optimization problems, optimality conditions, and algorithms. The second part of the lecture is devoted to the analysis of first order convex optimization algorithms that are ubiquitious in data science applications [...] and Statistics. Then, the study of convex duality allows us to introduce widely used primal-dual algorithms. This course is devoted to the mathematical fundaments. However, convex optimization techniques
in Paris. In Kurt Mehlhorn's Group "Algorithms & Complexity" she will continue her studies on approximation algorithms, combinatorial optimization, and graph algorithms. Qianru Sun earned her PhD from Peking
n between computer graphics and machine learning with a focus on rendering. We seek to develop algorithms and data structures which enable fast and high-quality image generation for interactive virtual [...] solutions. Research Areas and Achievements Diverse Rendering We consider all types of image synthesis algorithms and explore the entire continuum of techniques. This includes physically-based, image-based, and [...] require visual feedback in the order of milliseconds. To meet these extreme constraints, we conduct algorithm development with in-built parallelism, such that we can benefit from specialized hardware such as
Research Departments Algorithms and Complexity People Daniel Neuen Dr. Daniel Neuen Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Location E1 4 - [...] Daniel Neuen. Isomorphism testing for graphs excluding small topological subgraphs. ACM Trans. Algorithms, 20(3):25, 2024. DOI . Martin Grohe, Daniel Neuen, and Pascal Schweitzer. A faster isomorphism [...] Daniel Neuen and Pascal Schweitzer. An exponential lower bound for individualization-refinement algorithms for graph isomorphism. In 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los
development, he has cleverly combined algorithmic concepts from computer graphics, image recognition, and machine learning. Since Christian Theobalt's algorithms eliminate the need for markers on the body [...] teaches at Saarland University. Together with his research group, he develops image acquisition algorithms that do not require any marker points on the subjects to be captured in order to detect their motions [...] The Beckurts Prize honors his research work on "Capturing Reality", in which he has developed algorithms to measure and analyze movements three-dimensionally and in real time. Thanks to his work, model
new algorithms that, on the one hand, empower profoundly advanced functional capabilities in the name-giving areas and, at the same time, enable better accountability for the underlying algorithms in the [...] information technology in the areas of algorithms and complexity, as well as logic of programming. At the same time researchers at the institute have developed new algorithms for various application areas such [...] supporting pillars of our internationally recognized research location, a beacon in the exploration of algorithms, machine learning and computer graphics. With this strong performance, the MPI has brought to Saarland
implement machine learning algorithms. In this sense, it is different from the introductory courses on machine learning. Here, we focus on mathematical models of learning algorithms, and obtaining provable [...] Research Departments Algorithms and Complexity Teaching Summer 2023 Seminar: Foundations of Machine Learning Foundations of Machine Learning Seminar Basic Information Lectures: Wednesday, 16:00 to 18:00 [...] Chapter 8 and 10 E1 4, 024 June 14 Georgi Vitanov Regression Chapter 11 E1 4, 021 June 21 Hans Simon Algorithmic Stability Chapter 14 E1 4, 024 June 28 Georgi Vitanov Dimensionality Reduction Chapter 15 E1 4
Research Departments Algorithms and Complexity People Sander Borst Dr. Sander Borst Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Location E1 4 - [...] Information Find more information on my personal website . Research Interests My research focuses on algorithms for online problems, such as online (hypergraph) matching and problems in online network design
