Skip to main content or main navigation Institute D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6 [...] Institute Hiring: CS/EE postdoc (m/f/d) & PhD positions (m/f/d) on optical networking Departments D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics [...] Automation of Logic RG2 Network and Cloud Systems RG3 Multimodal Language Processing Publications Algorithms & Complexity Computer Vision and Machine Learning Internet Architecture Computer Graphics Databases
Research Departments Algorithms and Complexity ADFOCS 25th Max Planck Advanced Course on the Foundations of Computer Science Travel Information Travel Information We strongly recommend to carry some Euros
Joël Ouaknine, director at MPI-SWS, was also awarded that prestigious status for contributions to algorithmic analysis of dynamical systems The number of Saarbrücken-based ACM fellows ist now seven, five of [...] medical informatics; Joël Ouaknine, director at MPI-SWS, receives the honor for contributions to algorithmic analysis of dynamical systems; Bernt Schiele, director at MPI-INF, for contributions to large-scale [...] is Director at the Max Planck Institute for Software Systems, where he leads the Foundations of Algorithmic Verification group. Bernt Schiele's research areas are computer vision and multimodal sensor processing
is dedicated to the advancement of knowledge on image perception and the development of imaging algorithms with embedded computational models of the human visual system. His scholarly output includes 39
evaluation algorithms cannot be applied to large volumes of data, which we obtain through information extraction from the World Wide Web. Our research concentrates on efficient approximation algorithms with
description: Recently, extensive anecdotal evidence emerged indicating that YouTube’s recommendation algorithm is promoting videos that are harmful to young children. In this work, to shed light into this problem
Skip to main content or main navigation Institute D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6 [...] Institute Hiring: CS/EE postdoc (m/f/d) & PhD positions (m/f/d) on optical networking Departments D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics [...] Automation of Logic RG2 Network and Cloud Systems RG3 Multimodal Language Processing Publications Algorithms & Complexity Computer Vision and Machine Learning Internet Architecture Computer Graphics Databases
superpixels. Additionally this work extends a state-of-the-art hierarchical image segmentation algorithm to include motion-cues, for the extraction of superpixels. The provided source code includes pe
insufficient throughput for video-streaming is to employ some form of adaptive bitrate (ABR) algorithm. An ABR algorithm selects a specific video quality that has a throughput requirement lower than the available [...] video is not always ideal. This results in a lowered visual quality due to the "adaptive bitrate algorithms" (ABR) that try to select a quality of video that is small enough, in terms of video bitrate and [...] and thus amount of data, to be streamed under all current network conditions. As those algorithms are not perfect, the visual quality degrades unnecessarily. In the worst case the ABR misjudges the network
distributed graph algorithms Abstract: I will discuss the notion of locality in the context of graph problems, from four different perspectives: online graph algorithms, dynamic graph algorithms, sequential [...] distributed algorithms, and parallel distributed algorithms. I will use the graph coloring problem as a running example, and I will explore settings like this: - Online graph algorithms: The adversary [...] that lends itself to efficient sublinear algorithms. We complement our algorithmic results by establishing nearly matching lower bounds that rule out algorithms with better performance guarantees in each
