[Cs-affiliates] Departmental Seminar, Monday Jan. 30 - Sofya Raskhodnikova
Devits, Christopher R
cdevits at bu.edu
Mon Jan 30 08:28:46 EST 2017
Dear All – a reminder of this morning’s departmental seminar. Hope to see you all there.
From: <owner-grs-cs-phds at bu.edu> on behalf of "Devits, Christopher R" <cdevits at bu.edu>
Date: Friday, January 27, 2017 at 11:12 AM
To: "cs-grads at cs.bu.edu" <cs-grads at cs.bu.edu>, "cs-instructors at cs.bu.edu" <cs-instructors at cs.bu.edu>
Subject: Departmental Seminar, Monday Jan. 30 - Sofya Raskhodnikova
Dear All – Please join us Monday for a departmental seminar. Details below.
Monday January 30, 2017
11:00AM to 12:15PM
Rafik B. Hariri Institute for Computing – Seminar Room
Massive datasets are becoming increasingly common. What useful computations can be performed on a dataset when reading all of it is prohibitively expensive? This question, fundamental to several fields, is at the heart of the research area, called sublinear-time algorithms, that has provided important insights into fast approximate computation.
In this talk, we will consider types of computational tasks central to sublinear-time algorithms: approximation, testing, and learning. We will see examples of sublinear-time algorithms in several domains. The algorithms themselves are typically simple and efficient, but their analysis requires insights into basic combinatorial, algebraic, and geometric questions. We will also discuss new directions in sublinear-time algorithms, including new computational tasks, new measures for accuracy guarantees, and new models for data access. These directions enable applications of sublinear-time algorithms in privacy, analysis of real-valued data, and situations where the data is noisy or incomplete.
Sofya Raskhodnikova is an associate professor of Computer Science and Engineering at Penn State. She received her Ph.D. from MIT. Prior to joining Penn State in 2007, she was a postdoctoral fellow at the Hebrew University of Jerusalem and the Weizmann Institute of Science. She has held visiting positions at the Institute for Pure and Applied Mathematics at UCLA, Boston University, and Harvard University. She is a recipient of the NSF CAREER award. Dr. Raskhodnikova works in the areas of randomized and approximation algorithms. Her main interest is the design and analysis of sublinear-time algorithms for combinatorial problems. She has also made important contributions to data privacy.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Cs-affiliates