כניסה

The algorithmic power of less

Abstract:

 

While working with large data sets it is often intractable to read the entire input, or storing it entirely in the memory. This motivates the study of sub-linear algorithms and streaming algorithms.

In this talk I will focus on two computational tasks for which we obtain such algorithms: computing edit distance, and approximating a matrix by a low rank matrix.

 

The talk would be mostly based on two recent works: A joint work with Diptarka Chakraborty and Michal Koucky and a joint work with Roee David and Robert Krauthgamer.

 

מתעניינים באקדמית?

הזינו פרטים ונחזור אליכם בהקדם
  • מאשר/ת קבלת דיוורים לדואר אלקטרוני

לשיחה עם נציג