Events

Nimesh Ghelani, Master’s candidate
David R. Cheriton School of Computer Science

High recall information retrieval is crucial to tasks such as electronic discovery and systematic review. Continuous Active Learning (CAL) is a technique where a human assessor works in loop with a machine learning model; the model presents a set of documents likely to be relevant and the assessor provides relevance feedback. 

Royal Sequiera, Master’s candidate
David R. Cheriton School of Computer Science

Daniel M. Berry
David R. Cheriton School of Computer Science

Dan Berry weaves the twin peaks of (1) his life in computing, programming, programming languages, software engineering, electronic publishing, and requirements engineering with (2) the almost concurrent development of programming languages, software engineering, and requirements engineering.

Vineet John, Master’s candidate
David R. Cheriton School of Computer Science

This thesis tackles the problem of disentangling the latent style and content variables in a language modelling context. This involves splitting the latent representations of documents by learning which features of a document are discriminative of its style and content, and encoding these features separately using neural network models.

Aiman Erbad, Computer Science and Engineering Department
Qatar University

Xiao-Bo Li, PhD candidate
David R. Cheriton School of Computer Science

Youngbin Kim, Master’s candidate
David R. Cheriton School of Computer Science

AbstractServerless architectures organized around loosely-coupled function invocations represent an emerging design for many applications. Recent work mostly focuses on user-facing products and event-driven processing pipelines. 

Abdullah Rashwan, PhD candidate
David R. Cheriton School of Computer Science

Pak Hay Chan, Master’s candidate
David R. Cheriton School of Computer Science

We consider a new problem of designing a network with small $s$-$t$ effective resistance. In this problem, we are given an undirected graph $G=(V,E)$ where each edge $e$ has a cost $c_e$ and a resistance $r_e$, two designated vertices $s,t \in V$, and a cost budget $k$.

Taylor Hornby, Master’s candidate
David R. Cheriton School of Computer Science

This thesis contributes to two areas. The first is the study of parallel repetition theorems and concentration bounds for nonlocal games and quantum interactive proofs. 

We make the following contributions: