The age of Big Data 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.

The answer will be found in the Lecture with the topic: “Fast computation: the magic of sampling” by Professor. Van Vu, Scientific Director of VinBigdata, Professor of Mathematics, Yale University, USA. In this talk, the professor discusses 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.

Prof. Van Vu’s lecture:

  • Content: “Fast computation: the magic of sampling”
  • Time: 9:15 am, Friday, January 8, 2021
  • Venue: Hoang Tuy Hall, 2nd Floor, Building A6, Institute of Mathematics, Vietnam Academy of Science and Technology, 18 Hoang Quoc Viet, Cau Giay, Hanoi
  • Registration deadline: January 6, 2021
  • Link for registration:
  • See more details of the event here
  • The lecture was livestreamed here

Share on facebook
Share on twitter
Share on linkedin

Relation Posts