YoVDO

Optimality of Algorithms for Approximation and Computation - Rothschild Lecture

Offered By: Isaac Newton Institute for Mathematical Sciences via YouTube

Tags

Approximation Theory Courses Data Science Courses Algorithms Courses Numerical Analysis Courses Computational Mathematics Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the cutting-edge research on optimality of algorithms for approximation and computation in this Rothschild Lecture delivered by Professor Ronald DeVore from Texas A&M University. Delve into the intricate world of data science as the lecture covers topics related to approximation, sampling, and compression. Gain insights into the latest developments in mathematical sciences and their applications in the field of data analysis. Presented at the prestigious Isaac Newton Institute for Mathematical Sciences, this hour-long talk offers a deep dive into the theoretical foundations that underpin modern computational methods.

Syllabus

Date: Tuesday 21st May 2019 - 16:00 to


Taught by

Isaac Newton Institute for Mathematical Sciences

Related Courses

Information Theory
The Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera