Search

We found 467 hits for your search of 'ALGORITHM'.
  1. Dani Dorfman

    /departments/algorithms-complexity/people/current-members/dani-dorfman

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

  2. Xinkai Shu

    /departments/algorithms-complexity/people/current-members/xinkai-shu

    Research Departments Algorithms and Complexity People Xinkai Shu Xinkai Shu Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Location E1 4 - 316 Phone

  3. Course Material

    /departments/algorithms-complexity/adfocs/2025/course-material

    Research Departments Algorithms and Complexity ADFOCS 25th Max Planck Advanced Course on the Foundations of Computer Science Course Material Course Material This webpage will contain all materials related

  4. Marc Habermann bestowed with Otto Hahn Medal of the Max Planck Society

    /readnews?tx_news_pi1%5Baction%5D=detail&tx_news_pi1%5Bcontroller%5D=News&tx_news_pi1%5Bnews%5D=359&cHash=3b909a9696bcfe78ec98803c83b81977

    „The prize is awarded for the development of novel GPU-parallelized optimization and deep learning algorithms for space-time coherent human performance capture and synthesis at real-time frame rates.“ Con

  5. Yonggang Jiang

    /departments/algorithms-complexity/people/current-members/yonggang-jiang

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

  6. Jonas Fischer

    /departments/computer-vision-and-machine-learning/people/jonas-fischer

    sparsity are algorithmic or fundamental, we propose a framework to plant and hide lottery tickets. With novel ticket benchmarks we then conclude that the limitation is likely algorithmic, encouraging further [...] sparsity are algorithmic or fundamental, we propose a framework to plant and hide lottery tickets. With novel ticket benchmarks we then conclude that the limitation is likely algorithmic, encouraging further [...] sparsity are algorithmic or fundamental, we propose a framework to plant and hide lottery tickets. With novel ticket benchmarks we then conclude that the limitation is likely algorithmic, encouraging further

  7. Puppeteering Faces

    /news/press-release-articles/2015/puppeteering-faces

    real time, whereas gestures and head movements remain unchanged. Thanks to the efficiency of the algorithms, this can be performed with standard computer hardware. Both persons are filmed with cameras that [...] stic depiction in the target video stream. Thanks to years of successful research, calculation algorithms are meanwhile efficient enough to be able to perform in real time on well-equipped standard computers

  8. Recognizing Human Activity

    /news/spotlight-articles/multimodal-information-visualization/recognizing-human-activity

    be sufficient to recognize the higher level composite activity and allow efficient recognition algorithms. Figure 2: Composite activity for construction Hierarchical model for composite activities Preserving [...] across different users, or the underlying activities can happen in different order. Using the same algorithms recognizing atomic activities can be suboptimal, as these require prohibitive amounts of training

  9. Research

    /departments/inet/research

    trol algorithms Despite four decades of research on congestion-control algorithms, there is yet no “one-size fits-all” solution. There are at least thirty different congestion-control algorithms or schemes [...] which user stream videos is not always ideal. The result is poor visual quality, as the underlying algorithms try to select a quality of video that is small enough (meaning reduced amount of data that has

  10. Summer 2024

    /departments/algorithms-complexity/teaching/summer24

    Research Departments Algorithms and Complexity Teaching Summer 2024 Teaching - Summer 2024 Fine-Grained Complexity Theory Core Course (4+2). Lecturer: Karl Bringmann. more Topics in Computational Social