Research Departments AlgorithmsandComplexity Teaching Summer 2024 Teaching - Summer 2024 Fine-Grained Complexity Theory Core Course (4+2). Lecturer: Karl Bringmann. more Topics in Computational Social [...] more Discrete Optimization Core Course (4+2). Lecturer: Andreas Karrenbauer. more Fine-Grained Complexity Theory Topics in Computational Social Choice Theory Discrete Optimization
navigation Institute D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6 Visual Computing and Artificial Intelligence [...] Intelligence BIO Research Group Computational Biology RG1 Automation of Logic RG2 Network and Cloud Systems RG3 Multimodal Language Processing Alumni Deutsch Departments Alumni Ganzinger Workshop on Programming
Computing Fine-Grained ComplexityandAlgorithm Design Graph Algorithms Learning-Augmented Algorithms Optimization Parameterized and Counting AlgorithmsandComplexity String Algorithmsand Data Compression [...] navigation Institute D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6 Visual Computing and Artificial Intelligence [...] Structure, Algorithms, Applications, and Open Problems (Kanazawa Talk) , Erice School on Graph Theory, Algorithms, and Applications, July 2008 ; Japan Conference on Computational Geometry and Graphs, November
mechanisms, implementation principles, network algorithms, advanced network architectures, network simulations, measurements and protocol specifications and verification techniques. Data Networks - Summer [...] of a series of activities starting with setting up the hardware and introducing basic configuration for VLANs and IPv4/IPv6 networks and gradually moving to more advanced topics, including but not limited [...] "On the practice of System and Network Engineering" In our block-seminar "On the practice of System and Network Engineering" , we will go into the practical side of system and network engineering, covering
Research Departments AlgorithmsandComplexity Teaching Teaching The members of the algorithms group of MPI-INF offer courses and thesis (bachelor, master, and PhD) topics in algorithmics. We offer the core [...] Course Course type Speaker / Tutor Algorithmsand Data Structures Core Course Karl Bringmann and Philip Wellnitz Sublinear Algorithms Advanced Course Karl Bringmann and Nithin Varma Ideen und Konzepte der [...] Course type Speaker / Tutor Randomized Algorithmsand Probabilistic Analysis of Algorithms Advanced Course Philip Wellnitz , Tutor: Baris Can Esmer Approximation Algorithms Advanced Course Joachim Spoerhase
Computational Complexity of Counting and Sampling (Discrete Mathematics and Its Applications). CRC Press 2019 [CCD19] Hubie Chen, Radu Curticapean, and Holger Dell. The Exponential-Time Complexity of Counting [...] Prerequisites: Basic knowledge in Algorithms Description In this course we give an introduction to counting problems and counting complexity. While often in complexity theory we investigate decision problems [...] Research Departments AlgorithmsandComplexity Teaching Summer 2023 Techniques for Counting Problems Techniques for Counting Problems Advanced Course, 2+1 Basic Information Lectures: Thursdays, 14:00 to
detection outperform both deep convolutional neural networks and methods that use more complex features (such as local binary patterns and covariance) by a large margin. In the last ten years, pedestrian [...] benchmarks for evaluating and comparing methods. In the last decade, numerous techniques have been developed for pedestrian detection. Using different image features, cues, and classifier types, detection [...] grounded on decade-old ideas (oriented gradients features, filter banks, and boosted decision trees) that we have carefully instantiated and adapted to our newest insights. Contrary to previous work, we show
