Seminar

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

Shubhangi Saraf, Associate Professor
Department of Mathematics, Department of Computer Science, University of Toronto

The recent exciting breakthrough by Limaye, Srinivasan, and Tavenas showing superpolynomial lower bounds for constant-depth algebraic circuits has underscored the importance of studying the complexity of set multilinear formulas.

Please note: This seminar will take place online.

Iden Kalemaj, PhD candidate
Department of Computer Science, Boston University

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

Akshay Ramachandran, Postdoctoral Researcher
University of Amsterdam and Centrum Wiskunde & Informatica

Please note: This PhD seminar will take place online.

Yetian Wang, PhD candidate
David R. Cheriton School of Computer Science

Supervisors: Professors Dan Berry, Grant Weddell

Please note: This PhD seminar will take place online.

Sajin Sasy, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Ian Goldberg

Please note: This PhD seminar will take place online and in person in DC 2585.

Wenhan (Cosmos) Zhu, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Michael Godfrey

Please note: This PhD seminar will take place in DC 2310.

Kam Chuen (Alex) Tung, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Lap Chi Lau

The classical Cheeger’s inequality relates the edge conductance of a graph and the second smallest eigenvalue of the Laplacian matrix. Recently, Olesker-Taylor and Zanetti discovered a Cheeger-type inequality connecting the vertex expansion of a graph and the maximum reweighted second smallest eigenvalue of the Laplacian matrix.

Please note: This PhD seminar will take place online.

Ji Xin, PhD candidate
David R. Cheriton School of Computer Science

Supervisors: Professors Jimmy Lin, Yaoliang Yu

Please note: This PhD seminar will take place online.

Ankit Vadehra, PhD candidate
David R. Cheriton School of Computer Science

Supervisors: Professors Pascal Poupart, Olga Vechtomova

The task of Grammar Error Correction (GEC) entails designing a system that is capable of performing text improvement and correcting semantic/syntax inconsistencies in a text span (sentence), while grammar error detection (GED) is used to classify whether a sentence is correct or not.

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

Vasiliki (Vasia) Kalavri, Assistant Professor
Department of Computer Science, Boston University

Enabling secure outsourced analytics with practical performance has been a long-standing research challenge in the database community. In this talk, I will present our work towards realizing this vision with Secrecy, a new framework for secure relational analytics in untrusted clouds.