Search

others, it covers message passing and shared memory, synchrony vs. asynchrony, fault-tolerance, and congestion. The focus lies on key concepts, algorithmic ideas, and mathematical analysis. Despite some [...] nts Read and believe how we would like to run this course . Subscription to our mailing list is mandatory and has two purposes: (1) We will use it to distribute material and information, and we will assume [...] Research Departments Algorithms and Complexity Teaching Theory of Distributed Systems Theory of Distributed Systems Advanced Course, 2+2 Basic Information Lectures: Thursday, 10:15 - 12:00, E1.4 024 Lecturer:

Research Departments Algorithms and Complexity Teaching Winter Semester 2017/2018 Ideen und Konzepte der Informatik Veranstaltungen für Studierende anderer Fakultäten (2+2). Dozenten: Antonios Antoniadis [...] Michael Sagraloff. more Algorithmic Game Theory, Mechanism Design and Computational Economics Advanced Course (2+1). Lecturer: Yun Kuen (Marco) Cheung. more Fine-Grained Complexity Theory Advanced Course [...] Karl Bringmann and Marvin Künnemann. more Theory of Distributed Systems Advanced Course (2+2). Lecturer: Christoph Lenzen. more Ideen und Konzepte der Informatik Computer Algebra Algorithmic Game Theory,

Predicted Scene Descriptions}, AUTHOR = {Wagner, Misha and Basevi, Hector and Shetty, Rakshith and Li, Wenbin and Malinowski, Mateusz and Fritz, Mario and Leonardis, Ales}, LANGUAGE = {eng}, ISBN = {978-3- [...] on Pattern Analysis and Machine Intelligence (TPAMI) International Journal of Computer Vision (IJCV) Journal of Mathematical Imaging and Vision (JMIV) Information Processing and Management (IPM) IEEE [...] Computational Intelligence and AI in Games Language and Linguistics Compass Publications 2018 1 Conference paper D2 M. Wagner, H. Basevi, R. Shetty, W. Li, M. Malinowski, M. Fritz, and A. Leonardis “Answering

algebra and tensor operations The CANDECOMP/PARAFAC (CP) decomposition and tensor rank Variants and applications of and algorithms for the CP decomposition The Tucker decompositions, their algorithms and [...] strengths and weaknesses, and algorithms for finding them. In addition, we will also cover other important topics related to tensors in data analysis, such as how to select which factorization to use and how [...] decompositions, and how they relate to the ones they already know. The students should be able to understand the basic algorithmic ideas used in computing the decompositions, and to read and implement basic

Research Departments Databases and Information Systems Teaching Winter Semester 2017/18 Winter Semester 2017/18 Information Retrieval and Data Mining Information Retrieval (IR) and Data Mining (DM) is a core [...] learn what are the major tensor decompositions, what are the algorithms for computing them, and what are their primary applications, strengths, and weaknesses. more Knowledge Bases In this block seminar, we [...] will study the syntax and semantics of the main ontology and rule-based languages. On the practical side we will exploit the available tools for the knowledge representation and reasoning. more Information

Computer Vision and Machine Learning Research Object Recognition and Scene Understanding Learning Non-Maximum Suppression Learning Non-Maximum Suppression (NMS) Jan Hosang , Rodrigo Benenson, and Bernt Schiele [...] facto standard NMS algorithm is still fully hand-crafted, suspiciously simple, and — being based on greedy clustering with a fixed distance threshold — forces a trade-off between recall and precision. We propose [...] only boxes and their score. We report experiments for person detection on PETS and for general object categories on the COCO dataset. Our approach shows promise providing improved localization and occlusion

D2 M. Lapin, M. Hein, and B. Schiele “Analysis and Optimization of Loss Functions for Multiclass, Top-k, and Multilabel Classification,” IEEE Transactions on Pattern Analysis and Machine Intelligence, [...] pinTPAMI2018, TITLE = {Analysis and Optimization of Loss Functions for Multiclass, Top-k, and Multilabel Classification}, AUTHOR = {Lapin, Maksim and Hein, Matthias and Schiele, Bernt}, LANGUAGE = {eng} [...] Neural Information Processing Systems 28 (NIPS 2015)}, EDITOR = {Cortes, C. and Lawrence, N. D. and Lee, D. D. and Sugiyama, M. and Garnett, R.}, PAGES = {1189--1197}, ADDRESS = {Montr{\'e}al, Canada}, } Endnote

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 [...] available here (119MB, uncompressed ca. 3.4GB) and SPASS's output file here (41MB, uncompress ca 2.4GB). The files and outputs are sorted by type encoding and facts size. For SPASS's files the fact size has [...] stands for the default heuritics and an 'i' suffix for the heuristics tailored to Isabelle. SupInd The evaluation results and the benchmark files for the IsaPlanner and Clam benchmark are avaiable here

Projects VeriDis: Modeling and Verification of Distributed Algorithms and Systems The VeriDis project aims to exploit and further develop the advances and integration of interactive and automated theorem proving [...] proving applied to the area of concurrent and distributed systems. The goal of the project is to assist algorithm and system designers to carry out formally proved developments, where proofs of relevant [...] theorem provers—superposition provers and SMT (satisfiability modulo theories) solvers—through middleware such as Sledgehammer for Isabelle/HOL and HOLyHammer for HOL Light and HOL4; but this research has now