Search

explanations for recommender systems and other machine learning models are crucial to gain user trust. Prior works that have focused on paths connecting users and items in a heterogeneous network have [...] intuitive baselines, and insights from a crowdsourced user-study demonstrate the viability of such action-based explanations. We thus posit that PRINCE produces scrutable, actionable, and concise explanations [...] actions, and minimal sets, respectively. Counterfactual Explanations for Neural Recommenders Understanding why specific items are recommended to users can significantly increase their trust and satisfaction

Sciences, HBNI, Chennai, India. She joined the Algorithms and Complexity group from October 2020. Her area of research is Parameterized Complexity, Kernelization and Graph Theory. Lingjie Liu received her Ph [...] University of Rome. In May 2018 she joined the "Databases and Information Systems" group of Gerhard Weikum. Her topic is “Personalised Search and Knowledge Harvesting for Health Domain”. Jiangxin Dong received [...] Computing and AI Department) of Prof. Christian Theobalt at the Max-Planck-Institute for Informatics in Oct 2019. Her research interests include neural rendering, human performance capture and modeling

video is encoded at different qualities ( i.e. , at different bitrates and/or resolutions) and details ( e.g. , quality levels and names of files associated with each level) are persisted in a manifest [...] (or video players) first fetch the manifest file, and download the video chunk by chunk. Prior to fetching each chunk, adaptive bitrate (ABR) algorithms in the video player determine the quality level of [...] stream experiences congestion along the path between the server and client, the ABR might, for instance, fetch the next chunk at a lower quality and avoid stalling ( i.e. , pausing) the video stream. To allow

Research Departments Algorithms and Complexity Research Parameterized and Counting Algorithms and Complexity Parameterized and Counting Algorithms and Complexity Parameterized complexity analyzes how different [...] Departments ALGO Algorithmic Game Theory Approximation Algorithms Fine-Grained Complexity and Algorithm Design Graph Algorithms Optimization Parameterized and Counting Algorithms and Complexity Robust Learning [...] different parameters of the input influence the complexity of hard algorithmic problems. The general goal is to show with fixed-parameter tractability results that the combinatorial explosion can be confined

of practitioners and new comers and to allow them to manipulate it in an intuitive way. Our algorithmic formulation is centered around objects like matrices, vectors and permutations, and acts by means of [...] sparse matrix-matrix multiplication, and maps. This linear algebra flavored representation serves several purposes: Compactness and readability. Algorithms are concise and easy to interpret. Dispensing with [...] through linear algebra kernels. The compactness and effectiveness of this representation makes allows encoding complex operation in simple, humanly readable, and highly performing code. A typical example is

2019-04-P, 85 p. M. John and A. Karrenbauer. Dynamic sparsification for quadratic assignment problems. In M. Khachay, Y. Kochetov, and P. Pardalos, editors, Mathematical Optimization Theory and Operations Research [...] pages 232{246, Cham, 2019. Springer International Publishing. Andreas Karrenbauer DEPT. 1 Algorithms and Complexity Phone +49 681 9325 1007 Email : karrenba@mpi-inf.mpg.de Questioning the Status Quo in Video [...] John and Andreas Karrenbauer, joined this project in 2016 as optimization experts. Our task was to modify the placement of the special characters of the traditional Azerty keyboard while letters and numbers

as finding patterns, routing, and survivable network design, and novel algorithmic results and new levels of algorithmic understanding can be achieved even for classic and well-studied problems. The candidates [...] Research Departments Algorithms and Complexity Offers Postdoc Position: ERC SYSTEMATICGRAPH project Postdoc positions are available at the Algorithms & Complexity group of the Max Planck Institute for [...] advantage. A successful candidate should have excellent knowledge of algorithms and/or complexity. Strong background parameterized complexity, fixed-parameter tractability, graph theory, combinatorics, or

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 Algorithms and Complexity 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

Lecturers Dr. Andrew Yates and Dr. Rishiraj Saha Roy Coordinators and Contact Sreyasi Nag Chowdhury and Azin Ghazimatin Lectures Wednesdays, 16-18, E1 3 - Hörsaal II (0.02) and Fridays, 14-16, E1 3 - Hörsaal [...] the web, social media and enterprises as well as multivariate datasets in these contexts. IR models and algorithms include text indexing, query processing, search result ranking, and information extraction [...] DM models and algorithms include pattern mining, rule mining, classification and recommendation. Both fields build on mathematical foundations from the areas of linear algebra, graph theory, and probability

of Amsterdam) and Ori Lahav (until 2017 Postdoc at the MPI for Software Systems, currently Univ. of Tel Aviv). Karl Bringmann Max-Planck-Institut für Informatik; Algorithms & Complexity Tel +49.681.9325-1005 [...] be available to him for research work on fine-grained complexity theory / linear programming. At the first reading, the term fine-granular complexity theory / linear programming appears to be arbitrarily [...] search algorithms has therefore been given a lot of attention since the beginning of the computer era. The knowledge about the limits of the theoretically possible efficiency of such algorithms avoids