Construction of high-dimensional point sets with small dispersion

Add to your list(s) Download to your calendar using vCal

• Mario Ullrich (Johannes Kepler Universität)
• Monday 18 February 2019, 15:30-16:05
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact INI IT.

ASCW01 - Challenges in optimal recovery and hyperbolic cross approximation

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 polynomial in $d$.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• All CMS events
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• bld31

Note that ex-directory lists are not shown.