Events

Filters
Export this event to calendar
iCal
RSS
RSS
Close X

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Thursday, March 21, 2024 3:00 pm - 4:00 pm EDT (GMT -04:00)

DSG Seminar Series • The Rise of ‘ScaleFlex’ — Modern Hardware Requires Modern Solutions

Please note: This seminar will take place online.

Wolfgang Lehner, Director, Institute of Systems Architecture
Head, Database Research Group, TU Dresden

Alexander Krause, Postdoctoral Researcher
Database Research Group, TU Dresden

Tuesday, March 26, 2024 3:00 pm - 4:00 pm EDT (GMT -04:00)

CANCELLED • Seminar • Algorithms and Complexity • On Personalized Differential Privacy

Please note: This seminar has been CANCELLED.

Juba Ziani, Assistant Professor
H. Milton Stewart School of Industrial and Systems Engineering, Georgia Tech

In this talk, I will be discussing “personalized” (or “individualized”) differential privacy, where different individuals can be offered different epsilons simultaneously within the same computation. I will be presenting two of my recent works on personalized DP in the central model:

Wednesday, March 27, 2024 10:30 am - 11:30 am EDT (GMT -04:00)

Seminar • Artificial Intelligence • Mathematical Foundations for Trustworthy Machine Learning

Please note: This seminar will take place in DC 1304.

Lunjia Hu, PhD candidate
Computer Science Department, Stanford University

Machine learning holds significant potential for positive societal impact. However, in critical applications involving people such as healthcare, employment, and lending, machine learning raises serious concerns of fairness, robustness, and interpretability. Addressing these concerns is crucial for making machine learning more trustworthy.

Wednesday, March 27, 2024 12:00 pm - 1:00 pm EDT (GMT -04:00)

Seminar • Algorithms and Complexity • Stochastic Minimum Vertex Cover with Few Queries: A 3/2-approximation

Please note: This seminar will take place in DC 3317 and online.

Mahsa Derakhshan, Assistant Professor
Khoury College of Computer Sciences, Northeastern University

In this talk, we discuss the stochastic vertex cover problem. In this problem, G is an arbitrary known graph, and G* is an unknown random subgraph of G containing each of its edges independently with a known probability p. Edges of G* can only be verified using edge queries. The goal in this problem is to find a minimum vertex cover of G* using a small number of queries.