Search

simple, and in practice very efficient, process such that it could compete with the optimal methods, even in terms of theoretical complexity. Michael Sagraloff DEPT. 1 Algorithms and ComplexityPhone +49 [...] Polynomial Systems and Applications in Geometric Computing Exact Solving of Polynomial Systems and Applications in Geometric Computing Michael Sagraloff Exact Solving of Polynomial Systems and Applications in [...] physics, and engineering. The research group “Computer Algebra and Geometric Computing” primarily investigates such systems as they typically arise from geometric problems. Most algorithms from computational

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 [...] Intranet Deutsch Departments Automation of Logic Teaching Automated Reasoning Exercises and Tutorials Exercises and Tutorials Exercises Please submit the solutions during the Tuesday lecture. Only handwritten [...] Intelligence BIO Research Group Computational Biology RG1 Automation of Logic RG2 Network and Cloud Systems RG3 Multimodal Language Processing Automation of Logic People Research Areas Automated Verification

Databases and Information Systems Research imPACT Fair Data Representations Learning Fair Representations of Data for Algorithmic Decision Making People are rated and ranked, towards algorithmic decision [...] accuracy in classification and regression models. Our notion of individual fairness requires that users who are similar in all task-relevant attributes such as job qualification, and disregarding all potentially [...] setting. Publication(s) Preethi Lahoti , Gerhard Weikum , and Krishna P. Gummadi , iFair: Learning Individually Fair Data Representations for Algorithmic Decision Making , Proceedings of the 35th IEEE International

Research Departments Algorithms and Complexity Teaching Summer 2019 Fine-Grained Complexity Theory Fine-Grained Complexity Theory Advanced Course, 3+1 Lectures: Tuesday + Thursday, 16:15 - 18:00, E1.4 [...] at the intersection of complexity theory and algorithm design which aims at a more fine-grained view of the complexity of polynomial-time problems. We present a mix of upper and lower bounds for fundamental [...] Subcubic Equivalences, continued 14 May MK BMM and Combinatorial Algorithms Exercise Sheet 2 16 May 21 May MK 3SUM: Algorithms I 23 May MK 3SUM: Algorithms II and Lower Bounds I 28 May Room Change to 029 MPI-SWS

Research Departments Algorithms and Complexity Teaching Fine-Grained Complexity Theory Fine-Grained Complexity Theory Advanced Course, 3+1 Lectures: Tuesday + Thursday, 16:15 - 18:00, E1.4 024 Lecturers: [...] at the intersection of complexity theory and algorithm design which aims at a more fine-grained view of the complexity of polynomial-time problems. We present a mix of upper and lower bounds for fundamental [...] lecture notes by M. Bläser and C. Saha on [division] and [multipoint evaluation and interpolation] Lecture 18 (16 Jan) Randomized Nondeterministic SETH is false; arithmetic circuits and the Schwartz-Zippel lemma

Research Departments Algorithms and Complexity Research Fine-Grained Complexity and Algorithm Design Fine-Grained Complexity and Algorithm Design Fine-grained Complexity Theory is the design of reductions [...] Departments ALGO Algorithmic Game Theory Approximation Algorithms Fine-Grained Complexity and Algorithm Design Graph Algorithms Optimization Parameterized and Counting Algorithms and Complexity Robust Learning [...] time lower bounds assuming a plausible complexity-theoretic conjecture such as the Strong Exponential Time Hypothesis. In this area the design of efficient algorithms goes hand in hand with proving fine-grained

have a kitchenette, a shower and a living-/bedroom the kitchen is well equipped (with appliances, fridge and freezer) and provides pots and pans, cutlery, and dishes; bedding and towels are supplied as well [...] 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 [...] Departments 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

ordinary differential equations. For a long time, only comparatively complex algorithms existed for the computation of streak and time lines, and they did not allow any conclusions about the inherent properties [...] Fabrication Digital Fabrication of Flexible Displays and Touch Sensors Eye-Based Human-Computer Interaction Stereo and HDR Imaging: Display Quality Measurement and Enhancement Advanced Real-Time Rendering PICASSO [...] streak and time lines can often be computed significantly faster using the new approach. The 5000 time lines in Figure 1 were computed within 14 seconds using our new method. The classic algorithm requires

egrated sensors and body-worn cameras to encode rich information on device usage and users’ visual scene. We demonstrate that our method can forecast bidirectional attention shifts and predict whether [...] [Oulasvirta et al. 2005] and then had to wait for the next chat message. To counter side effects due to learning and anticipation, we varied the waiting time between chat messages and search tasks. Second [...] participants (six females), aged between 22 and 31 years, using university mailing lists and study board postings. Participants were students with different backgrounds and subjects. All had normal or correct