Search

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

the long-lasting and sustainable influence of the ontology “YAGO”. Since a decade, this semantic and formal representing data base extracts and links text-based entries from Wikipedia and other internet [...] conference for research about the World Wide Web. YAGO is a light-weight and extensible ontology that automatically searches, finds and extracts relations between entities in internet sources like Wikipedia [...] scientists use a carefully designed combination of rule-based and heuristic extractions methods. The relations found by the automatic search algorithm have very low error rate. Meanwhile, YAGO contains more

Research Departments Algorithms and Complexity Offers Internships for Bacherlor with Honors Students from TU Vienna All departments of MPI for Informatics accept applications for internships by students [...] Please direct applications (in English) and general related questions to Dr. Andreas Karrenbauer . We advise that you identify potential area(s) of interest and encourage you to contact potential supervisors [...] supervisors before filing an application. The webpages of the departments and researchers at MPII inform about our research activities and interests, but we also encourage you to propose own topics. An application

procedures and apply these as part of a branch-and-cut algorithm. To show the effectiveness of this approach, we analyze feasible solutions for real microscopy data in terms of bounds and run-time, and by their [...] generalization of the MP with long-range terms (LMP). We design and implement two efficient algorithms (primal feasible heuristics) for the MP and LMP which allow us to study instances of both problems w.r [...] decompositions. Joint object and scene segmentation with dynamic CRFs This research project aims to improve scene and object segmentation by combining object detectors and bottom-up low-level segmentation

in the Computer Science Department at Pohang University of Science and Technology. In March 2018 she joined the Algorithms and Complexity Group of Kurt Mehlhorn. Qiuhong Ke worked as a PhD student at The [...] scientific ideas without exertion of influence. It consists of a two-year tax-free research fellowship and business expenses. For the strech of the next two years, four young female researchers in computer [...] In May she joined the Computer Vision Group of Bernt Schiele with her topic "Activity Recognition and Prediction". Sophie Tourret completed her PhD at the Grenoble Informatics Laboratory (France) in March

Research Departments Algorithms and Complexity Teaching Summer 2018 Keeping Time in Distributed Systems Keeping Time in Distributed Systems Advanced Course, 2+2 Basic Information Lectures: Friday, 14:15 [...] understanding of algorithmic techniques and proving worst-case guarantees mathematically. Particular emphasis is given to strong, possibly surprising, fault-tolerance properties and how they can be achieved [...] future videos. Read and believe how we would like to run this course . Subscription to our mailing list is mandatory (1) We will use it to distribute material and information, and we will assume that everyone

Departments Algorithms and Complexity Teaching Summer 2018 Selected Topics in Fine-Grained Complexity Theory Selected Topics in Fine-Grained Complexity Theory Seminar Lecturers: Karl Bringmann and Marvin Künnemann [...] intersection of complexity theory and algorithm design which aims at a more fine-grained view of the complexity of polynomial-time problems. As a follow-up to the lecture "Fine-grained complexity theory", we [...] Integer Programming and (min,+)/regular convolution "On Integer programming and Convolution" K. Jansen, L. Rohwedder unpublished (arXiv) 10 - Lower Bounds and Algorithms concerning k-OPT and bitonic TSP "F

the search space, and runtimes. Beyond NED: Fast and Effective Search Space Reduction for Complex Question Answering over Knowledge Bases , Philipp Christmann, Rishiraj Saha Roy, and Gerhard Weikum, WSDM [...] discriminative when it comes to algorithm design. Other key dimensions are covered within each sub-topic: like the complexity of questions addressed, and degrees of explainability and interactivity introduced [...] dynamically retrieved entity names and relational phrases. It augments this graph with types and semantic alignments, and computes the best answers by an algorithm for Group Steiner Trees. We evaluate

biologically relevant patterns (data mining) and to develop mathematical models for biological structures and processes. Extensive software systems are developed and used to accomplish these tasks. "Our society [...] ics skills and capabilities among our partners in the life sciences." In pharmaceutical research, health research and biotechnology, for example, a more precise understanding of the complex interactions [...] particular, can benefit from our findings and tools in their research and are increasingly dependent on them." With the development of this area, national and international societies, such as the International

tuned to efficiently handle subsumption and constraint refutation tests. The underlying algorithm is a branch-and-bound approach that uses the dual simplex algorithm proposed by Dutertre et al. [5]. Instead [...] problem is then solved via branch-and-bound. The other two cases, absolutely unbounded and implicitly bounded, are solved respectively via the unit cube test [2] and branch-and-bound on the original system [...] progress. [4] I. Dillig, T. Dillig, and A. Aiken. Cuts from proofs: A complete and practical technique for solving linear inequalities over integers. In A. Bouajjani and O. Maler, editors, Computer Aided