Banach spaces, as complete normed vector spaces, form a central framework in modern functional analysis. Their rich geometric structure underpins much of the theoretical development in approximation ...

We consider the problem of approximating a given element f from a Hilbert space $\scr{H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical ...

This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) ...

This is an advanced undergraduate course on algorithms. This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for ...

This paper considers several "greedy" type algorithms based on grouping parts according to exact matching of field lives. Then, a generalization is presented which allows approximate matches. The ...

This course is available on the MSc in Applicable Mathematics, MSc in Data Science, MSc in Operations Research & Analytics, MSc in Statistics, MSc in Statistics (Financial Statistics), MSc in ...