University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Construction of high-dimensional point sets with small dispersion

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Construction of high-dimensional point sets with small dispersion

Download to your calendar using vCal

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:

Note that ex-directory lists are not shown.

Other lists

Hardy Building 101 Cancer Research UK Cambridge Institute, Room 001 Zoom meeting - find registration link below the abstract

Other talks

Not-so-noble gases, key tracers of Earth’s habitability: what their behaviour in planetary interiors can tell us? Title to be confirmed TBC An Amphibious Urbanism | | Cut 4: The Desert Arrives Slowly Title TBC Group Presentation 2
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity