Irish Medina, Master’s candidate
David R. Cheriton School of Computer Science
Smart water meters have been installed across Abbotsford, British Columbia, Canada, to measure the water consumption of households in the area. Using this water consumption data, we develop machine learning and deep learning models to predict daily water consumption for existing multi-family residences. We also present a new methodology for predicting the water consumption of new housing developments.
Filip Pawlega, Master’s candidate
David R. Cheriton School of Computer Science
Angshuman Ghosh, Master’s candidate
David R. Cheriton School of Computer Science
Matthew Amy, PhD candidate
David R. Cheriton School of Computer Science
Ricardo Salmon, PhD candidate
David R. Cheriton School of Computer Science
Finn Lidbetter, Master’s candidate
David R. Cheriton School of Computer Science
Let x and y be words. We consider the languages whose words z are those for which the numbers of occurrences of x and y, as subwords of z, are the same (resp., the number of x's is less than the number of y's, resp., is less than or equal). In this talk we will give a necessary and sufficient condition on x and y for these languages to be regular, and we show how to check this condition efficiently.
Ellen Arteca, Master’s candidate
David R. Cheriton School of Computer Science
Alexi Turcotte, Master’s candidate
David R. Cheriton School of Computer Science
Saman Barghi, PhD candidate
David R. Cheriton School of Computer Science
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:
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$.
Abdullah Rashwan, 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.
Xiao-Bo Li, PhD candidate
David R. Cheriton School of Computer Science
Aiman Erbad, Computer Science and Engineering Department
Qatar University
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.
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.
Royal Sequiera, Master’s candidate
David R. Cheriton School of Computer Science
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.
Shahin Rahbariasl, Master’s candidate
David R. Cheriton School of Computer Science
Irfan Ahmad, Founder and CEO
CachePhysics
Caches in modern distributed and storage systems must be manually tuned and sized in response to changing application’s workload. A balance must be achieved between cost, performance and revenue loss from cache sizing mis-matches. However, caches are inherently nonlinear systems making this exercise equivalent to solving a maze in the dark.
Kshitij Jain, Master’s candidate
David R. Cheriton School of Computer Science
We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s and t, and the goal is to find an s-t cut by assigning "powers'' at the vertices and removing an edge if the sum of the powers at its endpoints is at least its weight. The objective is to minimize the sum of the assigned powers.
Cecylia Bocovich, PhD candidate
David R. Cheriton School of Computer Science
Vern Paxson
Department of Electrical Engineering and Computer Sciences, University of California, Berkeley
Chief Scientist, Corelight, Inc.
Lead, Networking and Security Group, International Computer Science Institute
Hamed Haddadi, Senior Lecturer and Deputy Director of Research
Dyson School of Design Engineering
Academic Fellow, Data Science Institute, Imperial College London