Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
teaching:seminarae-ws2015 [2015-11-23 11:26] Denis Kurz [Themenliste] Paper-Titel korrigiert |
teaching:seminarae-ws2015 [2016-02-11 13:52] (current) Denis Kurz Vortragstermine ergänzt |
||
|---|---|---|---|
| Line 56: | Line 56: | ||
| Die Vorträge werden am 16./17.02.2016 im Raum 202, OH14 gehalten. | Die Vorträge werden am 16./17.02.2016 im Raum 202, OH14 gehalten. | ||
| + | |||
| + | |||
| + | | ^ Dienstag, 16.02.2016 ^ Mittwoch, 17.02.2016 ^ | ||
| + | ^ 9:30-10:30 | | **Approximate Graph Mining with Label Costs** \\ //Erik Thordsen// | | ||
| + | ^ 10:30-11:30 | **Efficient Implementation of a Synchronous \\ Parallel Push-Relabel Algorithm** \\ //Marcel Bargull// | **Standardized Mutual Information for Clustering Comparisons: \\ One Step Further in Adjustment for Chance** \\ //Lutz Oettershagen// | | ||
| + | ^ 11:30-12:30 | **Faster and More Dynamic Maximum Flow \\ by Incremental Breadth-First Search** \\ //Christian Everke// | **Random Features for Large-Scale Kernel Machines** \\ //Tim Schendekehl// | | ||
| + | ^ | (Mittagspause) | (Mittagspause) | | ||
| + | ^ 13:30-14:30 | **ParetoPrep: Fast Computation of Path Skylines Queries** \\ //Jan Goclik// | **Computing Classic Closeness Centrality, at Scale** \\ //Patrik Elfert// | | ||
| + | ^ 14:30-15:30 | **Public Transit Labeling** \\ //Kai Sauerwald// | **Fast Approximation of Betweenness Centrality \\ through Sampling** \\ //David Losch// | | ||
| + | ^ 15:30-16:30 | **Thinning out Steiner trees: A Node-Based Model \\ for Uniform Edge Costs** \\ //Shabnam Tabatabaian// | | | ||