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 [...] RG2 Network and Cloud Systems RG3 Multimodal Language Processing Publications Algorithms & Complexity Computer Vision and Machine Learning Internet Architecture Computer Graphics Databases and Information
researcher in the “AlgorithmsandComplexity” department at the Max Planck Institute for Informatics. Over time, two main families of methods have emerged for distributing seats: quota methods and divisor methods [...] the k-level problem. Specifically, the researchers were able to determine upper and lower bounds for this variability and demonstrate that it remains within a defined mathematical limit. This finding reaffirms [...] to areas of theoretical computer science and discrete mathematics. The study is therefore not only relevant for electoral systems but also discusses an algorithmic challenge, which the researchers tackled
Research Departments AlgorithmsandComplexity Teaching Winter 2020/21 How To Clock Your Computer How To Clock Your Computer Advanced Course, 4 Basic Information Lectures: Online. Zoom Link: https://c [...] introductory lecture, and a guided group discussion, towards framing good questions and finding answers to them. Hence there will be two "discussion sessions" every week. Anywhere between one and three sessions [...] be determined by the discussions and your presentation. To make discussions productive and engaging, you will be split into teams, each guided by a senior lecturer and a PhD student or a Postdoc working
IT-Security, Privacy and Accountability, the recently renewed Cluster of Excellence "Multimodal Computing and Interaction", the German Research Center for Artificial Intelligence (DFKI), and the Intel Visual [...] infection a node generates by summarizing the size, density, and diversity of the node's neighborhood. The metric assigns each node a score between 0 and 100. A node's expected force has over 90 percent correlation [...] ion and made the results available on a web page. The expected force (ExF) of each airport was calculated based on a database of 3,458 airports connected by 68,820 scheduled commercial routes and featuring
recent work showed that the algorithm can be adapted to dynamic networks, where nodes and connections may be added and removed. Recently, our group also showed that the GCS algorithm can be generalized to f [...] ion will be applicable to designing high performance computers and computer networks. Christoph Lenzen DEPT. 1 AlgorithmsandComplexity Phone +49 681 9325-1008 Email : clenzen@mpi-inf.mpg.de Questioning [...] optimal theoretical algorithm for the basic GCS problem has been known for 10 years, but there are still many open questions related to generalizing and implementing the algorithm. For example, recent
.mpg.de Christine Rizkallah DEPT. 1 AlgorithmsandComplexityPhone +49 681 9325-1112Email crizkall@mpi-inf.mpg.de Jens M. Schmidt DEPT. 1 AlgorithmsandComplexityPhone +49 681 9325-1008Email jeschmid@mpi-inf [...] alternative tools for the verification framework and comparing the results in terms of trust and effort needed. Adrian Neumann DEPT. 1 AlgorithmsandComplexityPhone +49 681 9325-1022Email aneumann@mpi-inf [...] 3-connected graph G Transferring an algorithm (i.e. a solution procedure to computer code is difficult and error prone. For that reason, the code may contain many mistakes, and subtle errors can be very hard
Neumann, Jens Schmidt and Christine Rizkallah Transferring an algorithm (i.e. a solution procedure, which is usually given as a natural language description) to computer code is difficult and error prone. Even [...] Through certifying algorithms we can use this powerful technique to prove that our algorithm's answers are always correct if the checker agrees with them. Developing certifying algorithms is a major goal [...] testing a graph for 3-connectivity and for 3-edge-connectivity. These problems are important for various applications in the areas of graph drawing and graph embeddings and for validating 3D-polytopes. Although
Neumann, Jens Schmidt and Christine Rizkallah Transferring an algorithm (i.e. a solution procedure, which is usually given as a natural language description) to computer code is difficult and error prone. Even [...] Through certifying algorithms we can use this powerful technique to prove that our algorithm's answers are always correct if the checker agrees with them. Developing certifying algorithms is a major goal [...] testing a graph for 3-connectivity and for 3-edge-connectivity. These problems are important for various applications in the areas of graph drawing and graph embeddings and for validating 3D-polytopes. Although
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 [...] RG2 Network and Cloud Systems RG3 Multimodal Language Processing Publications Algorithms & Complexity Computer Vision and Machine Learning Internet Architecture Computer Graphics Databases and Information
to have significant potential for activity recognition and computational behaviour analysis but previous works focused on supervisedmethods and recognition of predefined activity classes basedon short-term [...] representation of visual behaviour encoding saccades, fixations, and blinks with a latent Dirichlet allocation (LDA) topic model. We further propose and evaluate different methods to encode saccades for use in [...] reading, computer work, watching media, and eating. In addition, we include periods with no specific activity. We show the ability of our method to model and discover these activities with competitive
