Bài giảng viện

Thời gian: 9h15, Thứ 6 ngày 8 tháng 1 năm 2021

Địa điểm: Hội trường Hoàng Tụy, Tầng 2 nhà A6, Viện Toán học

Tóm tắt: The age of Bigdata is Now.

In modern applications in Bigdata, we often have to compute with huge matrices. While many algorithms have polynomial time running time, they are still not applicable when the size of the matrix exceeds a certain threshold. How to make computation with large matrices faster is a question of fundamental importance with a wide range of applications.

In this talk, we discuss the idea of using random sampling to speed up. This, in turns, has quickly led to challenging mathematical problems in perturbation theory and the theory of random matrices.