zum Inhalt springen

Kolloquium über Informatik

Termine Sommersemester 2021

Der nächste Termin ist fett getdruckt. Abstracts befinden sich weiter unten auf dieser Seite.

Termin

Vortragende*r

Titel

16. April 2021

Katarzyna Bozek (Center for Molecular Medicine Cologne, University of Cologne)

Data science of bioimages

23. April 2021

TBA

TBA

30. April 2021

TBA

TBA

7. Mai 2021

TBA

TBA

14. Mai 2021

TBA

TBA

21. Mai 2021

Antonios Antoniadis (University of Twente)

TBA

4. Juni 2021

TBA

TBA

11. Juni 2021

TBA

TBA

18. Juni 2021

TBA

TBA

25. Juni 2021

TBA

TBA

2. Juli 2021

TBA

TBA

9. Juli 2021

TBA

TBA

16. Juli 2021

TBA

TBA

23. Juli 2021

TBA

TBA

 

Abstracts

 

16. April 2021: Katarzyna Bozek (Universität zu Köln)

Titel: Data science of bioimages

Abstract:

In this talk I will introduce research done in my group “Data science of bioimages”. I will use my recent work on dense object tracking as an example to illustrate challenges of bioimage analysis as well as opportunities it presents for method advancement in computer vision. Across the various projects performed in my group we encounter challenges that often cannot be resolved with existing computer vision methods. Our solutions therefore require method development drawing knowledge not only from computer vision and machine learning but also from process parallelization or algorithm optimization. While computational biology has grown into an established field, the recent progress in deep learning gave rise to a new area of computer vision in biology with few yet existing standard methods.

 

Termine vergangner Semester (seit Wintersemester 2019/2020)

 

Termin

Vortragende*r

Titel

12. Februar 2021

Felix Hommelsheim (Technische Universität Dortmund)

Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity

29. Januar 2021

David Weckbecker (Technische Universität Darmstadt)

Unified Greedy Approximability Beyond Submodular Maximization

22. Januar 2021

Svenja Griesbach (Unviersität zu Köln)

Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages

15. Januar 2021

David Scholz (Technische Hochschule Köln)

Generating Optimal 1-Planar Graphs for automated Conjecture-Making

18. Dezember 2020

André Nusser (MPI Informatik, Saarbrücken)

Algorithm Engineering of the Fréchet Distance & the Fréchet Distance Under Translation

4. Dezember 2020

Sándor Kisfaludi-Bak (MPI Informatik, Saarbrücken)

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP

20. November 2020

Bhaskar Ray Chaudhury (MPI Informatik, Saarbrücken)

On the Existence of EFX Allocations

13. November 2020

Tim Oosterwijk (Universität Maastricht)

The Secretary Problem with Independent Sampling

6. November 2020

Stefan Zellmann (Universität zu Köln)

Kräftebasiertes Graphenzeichnen mit Hilfe von GPU Ray Tracing Cores

21. August 2020

Pan Peng (University of Sheffield)

On Testability of First-Order Properties in Bounded-Degree Graphs

15. Juli 2020

Lin Chen (Texas Tech University)

On block-structured integer programming

10. Juli 2020

Stefan Walzer (TU Ilmenau)

Space Efficient Data Structures using Hashing

26. Juni 2020

Vincent Cohen-Addad (Google Research)

On the Parameterized Complexity of Various Clustering Problems

19. Juni 2020

Pieter Kleer (MPI Informatik, Saarbrücken)

Secretary and Online Matching Problems with Machine Learned Advice

5. Juni 2020

Andrés Cristi (Universidad de Chile)

The two-sided game of Googol and sample-based prophet inequalities

15. Mai 2020

Maximilian Janke (TU München)

Scheduling in the Random-Order Model

8. Mai 2020

Václav Rozhoň (ETH Zürich)

Improved analysis of Lattanzi-Sohler algorithm

24. April 2020

Hendrik Fichtenberger (TU Dortmund)

Size Doesn't Matter: Approximate Decisions on Graphs

24. Januar 2020

Michael Kapralov (EPFL)

Dynamic Streaming Spectral Sparsification in Nearly Linear Time and Space

10. Januar 2020

Piotr Sankowski (Universität Warschau)

Walking Randomly, Massively, and Efficiently

15. November 2019

Heiko Röglin (Universität Bonn)

 Analysis of Ward's Method