All Topics (February 1 through April 30)

Friday, April 25

• 11:00 AM Indexing for Interactive Exploration of Big Data Series: Kostas Zoumpatianos, University of Trento
• 2:30 PM Reducing the Sample Complexity of Private Learners: Kobbi Nissim, Ben-Gurion Univeristy (Theory Seminar)

Monday, April 28

• 2:00 PM L_p-testing: Sofya Raskhodnikova, PSU (Theory Seminar)

Wednesday, April 30

• 4:00 PM Combinatorial Properties of Binary Tables with Fixed Marginals: Behzad Golshan, PhD Oral Exam

Monday, May 5

• 2:00 AM Spectral Graph Sparsification and Fast Laplacian Solvers: Yiannis Koutis, Brown (Theory Seminar)

Tuesday, May 6

• 11:00 AM Electrical measures of importance for network edges: Harry Mavroforakis (PhD Oral Exam)
• 1:30 PM Design Automation Tools For Metabolic Networks: Soha Hassoun, Tufts (Data Management Seminar)

Friday, May 16

• 2:00 PM A Bayesian Framework for Online Classifier Ensemble: Jerry Bai (IVC Seminar)

Monday, May 19

• All Day Charles River Workshop on Private Analysis of Social Networks

Monday, May 26

• All Day Memorial Day

Tuesday, May 27

• 10:00 AM On Querying Encrypted Graph: Xianrui Meng (PhD Oral Exam)

Friday, June 20

• 10:00 AM Hashing for Large-scale Nearest neighbor search: Fatih Cakir (PhD Oral Defense)

Friday, July 4

• All Day Independence Day

Wednesday, July 9

• All Day Towards a Unified Theory of Cryptographic Agents: Manoj M Prabhakaran, UIUC.

Monday, July 14

• 10:00 AM Approaches for finding boundaries of objects in images: Danna Gurari, PhD Oral Exam

Friday, July 18

• 10:30 AM Efficient Non-Malleable Codes and Key-derivations for poly-size tampering circuit: Pratyay Mukherjee, Aarhus.