PhD Seminar • Machine Learning • Annealing Knowledge Distillation
Please note: This PhD seminar will take place online.
Aref Jafari, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Ali Ghodsi
Aref Jafari, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Ali Ghodsi
Ihab Ilyas
Professor, Cheriton School of Computer Science
NSERC-Thomson Reuters Research Chair on Data Quality
Distinguished Engineer, Apple
Ajiromola Kola-Olawuyi, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Mei Nagappan
This study focuses on factors that may significantly influence the outcomes of CI builds triggered by commits modifying and/or adding DevOps artefacts to the projects, i.e., DevOps-related CI builds. In particular, code ownership of DevOps artefacts is one such factor that could impact DevOps-related CI builds.
Gustavo Sutter Pessurno de Carvalho, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Pascal Poupart
Pablo Millán Arias, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Lila Kari
Kamyar Ghajar, Master’s candidate
David R. Cheriton School of Computer Science
Supervisors: Professors Mark Smucker, Charles Clarke
Luyun Lin, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Jimmy Lin
Catherine He is a master of the keyboard.
She is not only a computer science student in her third year, but also an accomplished musician who began playing the piano at the age of 4 — an award winner of many regional, national and international piano competitions, among them orchestra@uwaterloo’s 2023 Concerto and Aria Competition, a contest open to Waterloo students and recent grads every other year.
Ehsan Ganjidoost, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Jeff Orchard
Rachel Yun Zhang, PhD student
CSAIL, Massachusetts Institute of Technology
A code, which is a set of strings called codewords, is locally testable if one can test whether a given word is close to a codeword by reading only a few bits. Locally testable codes have been studied since the 1990s as key ingredients in the construction of probabilistically checkable proofs.