Search

We found 530 hits for your search of 'Algorithms and Complexity'.
  1. Thomas Lengauer is president of the leading international society for bioinformatics

    /news/press-release-articles/2018/thomas-lengauer-is-president-of-the-leading-international-society-for-bioinformatics

    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

  2. SPASS-IQ

    /departments/automation-of-logic/software/spass-workbench/spass-iq

    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

  3. Reading Group Algorithms

    /departments/algorithms-complexity/teaching/summer18/reading-group

    Research Departments Algorithms and Complexity Teaching Summer 2018 Reading Group Algorithms Reading Group Algorithms Seminar Basic Information Given by: Kurt Mehlhorn , Daniel Vaz Time: Wednesday, 4:15 [...] Bounded Treewidth Graphs: Algorithms and Hardness Results Anupam Gupta, Kunal Talwar, David Witmer Daniel Vaz Complex brain networks: graph theoretical analysis of structural and functional systems (alternative [...] Prerequisites: You should bring a solid background in algorithms and data structures. This is an advanced seminar. The papers are challenging and a proper preparation of your talk will require some effort

  4. Optimization

    /departments/algorithms-complexity/teaching/summer18/opt

    The simplex algorithm and the ellipsoid method will be presented. The lecture concludes with exact and approximation algorithms for NP-hard optimization problems. There will be theoretical and practical [...] (except on May, 7 and May, 22: room 021, E1 4) Friday, 12-14, room 024, E1 4 Credits: 9 Prerequisites: Basics in linear algebra, discrete mathematics, calculus, algorithms, and complexity. At Saarland University [...] Research Departments Algorithms and Complexity Teaching Summer 2018 Optimization Optimization Core Course, 4+2 Basic Information Lecturer: Andreas Karrenbauer Lectures: Tuesday + Thursday, 14:00 - 16:00

  5. Summer 2018

    /departments/algorithms-complexity/teaching/summer18

    Research Departments Algorithms and Complexity Teaching Summer 2018 Summer Semester 2018 Keeping Time in Distributed Systems Advanced Course (2+2). Lecturer: Christoph Lenzen. more Selected Topics in [...] Fine-Grained Complexity Theory Seminar (2+0). Lecturers: Karl Bringmann and Marvin Künnemann. more A first introduction to geometric complexity theory Advanced Course (2+2). Lecturers: Markus Bläser, Christian [...] Karrenbauer. more Reading Group Algorithms Seminar (2+0). Given by: Kurt Mehlhorn, and Daniel Vaz. more Keeping Time in Distributed Systems Selected Topics in Fine-Grained Complexity Theory A first introduction

  6. Primer

    /departments/automation-of-logic/software/waldmeister/primer

    Waldmeister and find this example in the distribution. Just move to the Waldmeister directory and type bin/waldmeister example.pr Output from a successful proof A system header appears, and Waldmeister [...] from the specification and - if successful - decides if the conjectives hold. SORTS ANY % ANY1 ANY2 In section SORTS, the identifiers of the sorts the operators shall work on and the variables may belong [...] s, and all sorts are considered disjoint. SIGNATURE e: i: ANY f: ANY ANY sk: -> ANY -> ANY -> ANY -> ANY Section SIGNATURE contains the declaration of identifiers for operators, i.e. functions and constants

  7. Implementation

    /departments/automation-of-logic/software/waldmeister/implementation

    sense and contain pairs of terms: namely rules, equations, goals, and critical pairs. Initially, E includes the axioms and G the hypotheses. The set CP(R,E) is a function of the current sets R and E and [...] sense and contain pairs of terms: namely rules, equations, goals, and critical pairs. Initially, E includes the axioms and G the hypotheses. The set CP(R,E) is a function of the current sets R and E and [...] minimized. As only critical pairs built with rules and equations from R and E selected will be added to SUE, we must guarantee that R and E selected holds rules and equations which are minimal in the following

  8. Christian Theobalt awarded Karl Heinz Beckurts-Preis 2017

    /news/press-release-articles/2017/christian-theobalt-awarded-karl-heinz-beckurts-preis-2017

    developed algorithms to measure and analyze movements three-dimensionally and in real time. Thanks to his work, model acquisition is possible even when several people in the image are moving quickly and even [...] Beckurts Prize 2017 for his trend-setting insights and developments to efficiently capture human movements, poses, gestures, and facial expressions from videos and transfer them into 3D models. His methods are [...] camera. The methods allow for new applications, including virtual and augmented reality, telepresence, and motion analysis in sports and medicine. Christian Theobalt is head of the research group Graphics

  9. Offers

    /departments/inet/offers

    international connections? You are strong with measurement, analysis, statistics and algorithms? Would love to work in the beautiful and inspiring heart of the German Saarland? If you can answer these questions [...] Positions Direct Applications You are interested in researching the structure and architecture of the Internet, how they are and - more important - how they could be? Together with some of the world's most [...] different areas as part of immersion labs at different MPIs and universities. Latest in the 4th semester, they take the qualifying exam and start work with their chosen research advisor(s) at any of the

  10. Anja Feldmann

    /departments/inet/people/anja-feldmann

    {Seufert, Michael and Dietz, Katharina and Wehner, Nikolas and Gei{\ss}ler, Stefan and Sch{\"u}ler, Joshua and Wolz, Manuel and Hotho, Andreas and Casas, Pedro and Ho{\ss}feld, Tobias and Feldmann, Anja} [...] {Feldmann, Anja and Gasser, Oliver and Lichtblau, Franziska and Pujol, Enric and Poese, Ingmar and Dietzel, Christoph and Wagner, Daniel and Wichtlhuber, Matthias and Tapiador, Juan and Vallina-Rodriguez [...] {Feldmann, Anja and Gasser, Oliver and Lichtblau, Franziska and Pujol, Enric and Poese, Ingmar and Dietzel, Christoph and Wagner, Daniel and Wichtlhuber, Matthias and Tapiador, Juan and Vallina-Rodriguez