Cut on Bounded Treewidth Graphs [Jun26] Jul, 3 Alejandro A note on Max K-Vertex Cover: Faster FPTAS, Smaller Approximate Kernel and Improved Approximation [Jul3] Jul, 10 Virab An Illuminating Algorithm for [...] for theoretical computer science. The target audience of this reading group are master students, PhD students, as well as postdocs. Description We will read (more or less) recent papers in theoretical [...] Antoniadis Yes An Illuminating Algorithm for the Light Bulb Problem Josh Alman Marvin Künnemann Yes The 4/3 Additive Spanner Exponent is Tight Amir Abboud, Greg Bodwin Kavitha Telikapalli No Parameterized Ap
Efficiency in Games with Dynamic Population [Apr26] May, 3 Gorav Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds [May3] May, 10 Karl Streaming algorithms for embedding and computing [...] for theoretical computer science. The target audience of this reading group are master students, PhD students, as well as postdocs. Description We will read (more or less) recent papers in theoretical [...] and Efficiency in Games with Dynamic Population Thodoris Lykouris, Vasilis Syrgkanis, Éva Tardos [May3] Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds Michael A. Forbes, Amir
for theoretical computer science. The target audience of this reading group are master students, PhD students, as well as postdocs. Description We will read (more or less) recent papers in theoretical [...] has to be canceled due to illness. Please note that on Dec, 14, the reading group will take place at 3:00 PM already due to the MPII christmas party that will take place at 4:00 PM. In case that there is [...] minimum quadratic assignment problems Refael Hassin, Asaf Levin, Maxim Sviridenko Maximilian John X The 4/3 Additive Spanner Exponent is Tight Amir Abboud, Greg Bodwin Marco-Dick Yun Kuen Cheung Selling Two Goods
eleventh (last) meeting (on 15th July): https://cs-uni-saarland-de.zoom.us/j/92719699931?pwd=WlMyaGg3eCsxRG1QeDMrN3hXTkZCZz09 Schedule Date Speaker Topic Reference May 6 Bhaskar Introduction to the Reading Group [...] Golnoosh A Strongly Polynomial Algorithm for Linear Exchange Markets [May27] June 3 Laszlo Kozma Many Visits TSP [Jun3] June 10 Pascal On the Price of Anarchy for Flows over Time [Jun10] June 17 Lukas [...] Reading Group Algorithms Reading Group Algorithms Seminar Postponed by 4 weeks! Please note that on 11.3., the entire Saarland university has postponed the start of the semester by 4 weeks . This also affects
for theoretical computer science. The target audience of this reading group are master students, PhD students, as well as postdocs. Description We will read (more or less) recent papers in theoretical [...] multiplication algorithms from group orbits Joshua Grochow, Cristopher Moore Christian Ikenmeyer The 4/3 Additive Spanner Exponent is Tight Amir Abboud, Greg Bodwin Karl Bringmann Four Edge-Independent Spanning [...] The Chasm at Depth Four Gets Wider Pascal Koiran Improved Bounds for Reduction to Depth 4 and Depth 3 Sébastien Tavenas [May16] Sparse Kneser graphs are Hamiltonian Torsten Mütze, Jerri Nummenpalo, Bartosz
Sparsified Cholesky Solvers for SDD linear systems [Jan27] Feb, 3 Hang Zhou Dynamic Graph Connectivity in Polylogarithmic Worst Case Time [Feb3] Feb, 10 Antonios Antoniadis On the optimality of approximation [...] for theoretical computer science. The target audience of this reading group are master students, PhD students, as well as postdocs. Description We will read (more or less) recent papers in theoretical [...] Sparsified Cholesky Solvers for SDD linear systems Yin Tat Lee, Richard Peng and Daniel A. Spielman [Feb3] Dynamic Graph Connectivity in Polylogarithmic Worst Case Time Bruce Kapron, Valerie King and Ben Mountjoy
present the introductory chapters of the book (Chapter 2,3,4) in the first few weeks of the course. Every lecture of the subsequent week will consist of 2-3 student presentations. Each week (after the introductory [...] new chapter of the book every week. The target audience of this reading group are master students, PhD students, as well as postdocs. You can subscribe to the mailing list here: https://lists.mpi-inf.mpg [...] expected to prepare roughly one chapter of the book. The contents of the chapter would be divided into 2-3 logical parts, each forming one individual presentation. The decision on who presents in the coming
Challenging Real-World Scenes 3D Scene Analysis 3D Object Detection Markerless Reconstruction of Dynamic Scenes Advanced Video Processing Recognition of Kitchen Activities in Videos 3D Scene Understanding from [...] use textual descriptions (scripts), which can be easily collected, e.g., via crowd sourcing. Figure 3: Composite activities represented as attributes which can be transferred using textual script information [...] and Multimodal Computing Phone +49 681 9325-1206 Email rohrbach@mpi-inf.mpg.de Internet http://www.d2.mpi-inf.mpg.de/nlp4vision Describing Videos with Natural Language Ten Years of Pedestrian Detection
Photography Calibrated Display Management Recognizing Human Activity Correspondences and Symmetry in 3D Scenes Flow Analysis Optimizing User Interfaces for Human Performance
Ground Joinable Equations in Equational Theorem Proving, Baumgartner P., Zhang H., Proceedings of the 3rd International Workshop on First Order Theorem Proving (St Andrews, Scotland), Fachberichte Informatik [...] Informatik 5/2000, pages 33-43. Universität Koblenz-Landau 2000. BDP89 L. Bachmair, N. Dershowitz, D.A. Plaisted (1989): Completion Without Failure, Ait-Kaci H., Nivat M., Resolution of Equations in Algebraic [...] Bachmair, H. Ganzinger, C. Lynch, W. Snyder (1992): Basic Paramodulation and Superposition, Kapur D., Proceedings of the 11th International Conference on Automated Deduction (Saratoga Springs, USA), pages
