Search

We found 467 hits for your search of 'ALGORITHM'.
  1. Distributed Algorithms for Fault-tolerant Hardware

    /news/spotlight-articles/guarantees/distributed-algorithms-for-fault-tolerant-hardware

    News & Events Guarantees Distributed Algorithms for Fault-tolerant Hardware Distributed Algorithms for Fault-tolerant Hardware Christoph Lenzen Distributed Algorithms for Fault-tolerant Hardware Distributed [...] more reliable systems. Christoph Lenzen DEPT. 1 Algorithms and Complexity Phone +49 681 9325-1008 Email : clenzen@mpi-inf.mpg.de Distributed Algorithms for Fault-tolerant Hardware Exact Solving of Polynomial [...] operate correctly even if the red node or its outgoing links fail. We argue that using distributed algorithms, one can efficiently and reliably generate and distribute a clock signal on a significantly larger

  2. Distributed and Sequential Graph Algorithms

    /departments/algorithms-complexity/teaching/summer19/dist-seq-algo

    Research Departments Algorithms and Complexity Teaching Summer 2019 Distributed and Sequential Graph Algorithms Distributed and Sequential Graph Algorithms Advanced Course, 2+1 Basic Information Lectures: [...] de/listinfo/algorithms Prerequisites: Basic knowledge of algorithms, graph theory and probability will be assumed. Description In this course we study distributed and sequential algorithms for several [...] Graph Connectivity I: Sequential Algorithms Kargar's Mincut Algorithm Minimum k-Connected Subgraph Sheet 9 (Preliminary) 25.06.2019 Graph Connectivity II: Distributed Algorithms Lecture Notes No Homework 02

  3. Download

    /departments/automation-of-logic/software/spass-workbench/classic-spass-theorem-prover/download

    clauses are always split. Removed the flag -SplitHeuristic. Reimplemented the conjunctive normal form algorithm of FLOTTER. Added printing of the number of performed splits to the output. Added improved split

  4. Dreifache Ehrung für Saarbrücker Max-Planck Forscher

    /news/detail?tx_news_pi1%5Baction%5D=detail&tx_news_pi1%5Bcontroller%5D=News&tx_news_pi1%5Bnews%5D=417&cHash=3ffc1194394a6c5e2392498fbd82e443

    haft und Direktor am Max-Planck-Institut für Softwaresysteme, wo er die Gruppe Foundations of Algorithmic Verification leitet. Bernt Schieles Forschungsgebiete sind Computer Vision und das Verarbeiten

  5. Driving

    /services/international-office/international-office-restricted/driving

    Skip to main content or main navigation Institute D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6 [...] Institute Hiring: CS/EE postdoc (m/f/d) & PhD positions (m/f/d) on optical networking Departments D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics [...] Automation of Logic RG2 Network and Cloud Systems RG3 Multimodal Language Processing Publications Algorithms & Complexity Computer Vision and Machine Learning Internet Architecture Computer Graphics Databases

  6. Eating on Campus

    /services/international-office/international-office-restricted/eating-on-campus

    Skip to main content or main navigation Institute D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6 [...] Institute Hiring: CS/EE postdoc (m/f/d) & PhD positions (m/f/d) on optical networking Departments D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics [...] Automation of Logic RG2 Network and Cloud Systems RG3 Multimodal Language Processing Publications Algorithms & Complexity Computer Vision and Machine Learning Internet Architecture Computer Graphics Databases

  7. Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts

    /departments/computer-vision-and-machine-learning/research/image-segmentation/efficient-decomposition-of-image-and-mesh-graphs-by-lifted-multicuts

    propose a 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

  8. Eldar Insafutdinov

    /departments/computer-vision-and-machine-learning/people/alumni-and-former-members/eldar-insafutdinov

    Rother, T. Brox, B. Schiele, and B. Andres “Joint Graph Decomposition and Node Labeling: Problem, Algorithms, Applications,” in 30th IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2017) [...] @inproceedings{levinkov-2017-cvpr, TITLE = {Joint Graph Decomposition and Node Labeling: {P}roblem, Algorithms, Applications}, AUTHOR = {Levinkov, Evgeny and Uhrig, Jonas and Tang, Siyu and Omran, Mohamed and [...] MPI for Informatics, Max Planck Society %T Joint Graph Decomposition and Node Labeling: Problem, Algorithms, Applications : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-05DB-2 %R 10.1109/CVPR

  9. Elisa Schaaf

    /departments/algorithms-complexity/people/current-members/elisa-schaaf

    Research Departments Algorithms and Complexity People Elisa Schaaf Elisa Schaaf Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Location E1 4 - 302