around KBs, in particular factual KBs (e.g., Wikidata, YAGO, DBPedia), common-sense KBs (e.g., science knowledge, howto-knowledge, script knowledge) and non-textual KBs (e.g., ImageNet). We explore how these [...] 2018 -- Block seminar, Day 1 - Room 433 , MPI-Inf building (E 1.4, 4th floor) March 7, 2018 -- Block seminar, Day 2 - Room 433 , MPI-Inf building (E 1.4, 4th floor) Tentative Seminar Schedule Format: 25 minutes [...] meeting (participation is mandatory) [ pdf ] Time: 11:30 am - 13:00 am Place: Room 23, MPI-Inf building (E 1.4, ground level) Explanation of the structure and organization of the seminar Brief introduction to
esis{Kuzey2011, TITLE = {Extraction of Temporal Facts and Events from Wikipedia}, AUTHOR = {Kuzey, Erdal}, LANGUAGE = {eng}, LOCALID = {Local-ID: C1256DBF005F876D-E87CB338D81CD766C12578CC003C2F6E-Kuzey2011} [...] TensorFlow and Caffe2 using Python language for training and inference of CNNs. Caffe2 is relatively new framework, created to overcome the drawbacks of Caffe. Out of the two networks [...] TensorFlow and Caffe2 using Python language for training and inference of CNNs. Caffe2 is relatively new framework, created to overcome the drawbacks of Caffe. Out of the two networks
supervisor). The reading group counts as a seminar in your study program. You can register by sending an e-mail to Daniel . Please make sure that you read the section on prerequisites above before you register [...] Eunjin Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier [May30] Jun, 6 Ben A Distributed Algorithm for Spanning Trees [Jun06] Jun, 13 Pavel <cancelled> [Jun13] Jun, 20 Pavel [...] [Jun20] Jun, 27 Andreas Schmid Generalized comparison trees for point-location problems [Jun27] Jul, 4 Ben A Distributed Algorithm for Spanning Trees (reprise) [Jun06] Jul, 11 Max A Friendly Smoothed Analysis
Mehlhorn , Marvin Künnemann and Ruben Becker Time: Wednesday, 4:15 PM Room: 024 in E1.4 (MPII-Building), except for Nov, 4: 0.10 in E1.7 MMCI-Building First Meeting: October, 21 Credits: 7 credit points Prerequisites: [...] supervisor). The reading group counts as a seminar in your study program. You can register by sending an e-mail to Ruben . Please make sure that you read the section on prerequisites above before you register [...] [Feb3] Dynamic Graph Connectivity in Polylogarithmic Worst Case Time Bruce Kapron, Valerie King and Ben Mountjoy [Feb10] On the optimality of approximation schemes for the classical scheduling problem Lin
Given by: Kurt Mehlhorn , Ruben Becker , and Emanuele Natale Time: Wednesday, 4:15 PM Room: 024 in E1.4 (MPII-Building) First Meeting: April, 19 Credits: 7 credit points Prerequisites: You should bring [...] supervisor). The reading group counts as a seminar in your study program. You can register by sending an e-mail to Ruben . Please make sure that you read the section on prerequisites above before you register [...] Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds Michael A. Forbes, Amir Shpilka, Ben Lee Volk [May10] Streaming algorithms for embedding and computing edit distance in thelow distance
Lectures: Thursdays, 14:00 to 16:00, E1 4, Room 0.24 Lecturers: Jacob Focke , Philip Wellnitz First lecture: April 13 Tutorials: Tuesday, 16:00 to 18:00, every other week, E1 4, Room 0.24 Assistant: Philipp [...] Philipp Schepper First tutorial: May 2nd Credits: 5 Exam: Tuesday, August 08, 10:00, E1.4 Room 0.24 Prerequisites: Basic knowledge in Algorithms Description In this course we give an introduction to counting [...] Graph Colorings 1 [CCD19] May 11 (room change) JF Counting Graph Colorings 2 [CCD19] Changed room: E1.4 0.21 (May 18) May 25 PW Parameterized Counting 1 June 1 → June 6 PW Parameterized Counting 2 Moved
