FB 6 Mathematik/Informatik

Institut für Mathematik

Navigation und Suche der Universität Osnabrück



WS 2018/19

13.11.2018 um 14:15 Uhr in Raum 69/E23

Christian Kümmerle (Technische Universität München)

New Iteratively Reweighted Algorithms for Structured Low-Rank Matrix Approximation and Sparse Recovery

07.12.2018 um 9:15 Uhr in Raum 69/117

Dr. Mario Ullrich (Friedrich-Schiller-Universitaet Jena
und Johannes-Kepler-Universitaet Linz)

Deterministic constructions of point sets with small dispersion

Based on deep results from coding theory, we present an deterministic
algorithm that contructs a point set with dispersion at most $\eps$ in
dimension $d$ of size $poly(1/\eps)*\log(d)$, which is optimal with
respect to the dependence on $d$.
The running time of the algorithms is, although super-exponential in
$1/\eps$, only logarithmic in $d$.