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, August 9, 2018 10:00 am - 10:00 am EDT (GMT -04:00)

Master’s Thesis Presentation • Artificial Intelligence — Disentangled Representation Learning for Stylistic Variation in Neural Language Models

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.

Monday, August 13, 2018 10:00 am - 10:00 am EDT (GMT -04:00)

Master’s Thesis Presentation • Data Systems — Serverless Data Analytics with Flint

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. 

Wednesday, August 15, 2018 1:30 pm - 1:30 pm EDT (GMT -04:00)

Master’s Thesis Presentation • Algorithms and Complexity — The Complexity of Network Design for s-t Effective Resistance

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$.

Friday, August 17, 2018 1:00 pm - 1:00 pm EDT (GMT -04:00)

Master’s Thesis Presentation • Quantum Information and Computation — Concentration Bounds from Parallel Repetition Theorems: Symmetric Key

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: