Wednesday, August 29, 2018 — 1:30 PM EDT

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. 

Friday, August 24, 2018 — 1:30 PM EDT

Ellen Arteca, Master’s candidate
David R. Cheriton School of Computer Science

Friday, August 24, 2018 — 11:00 AM EDT

Alexi Turcotte, Master’s candidate
David R. Cheriton School of Computer Science

Tuesday, August 21, 2018 — 9:30 AM EDT

Saman Barghi, PhD candidate
David R. Cheriton School of Computer Science

Friday, August 17, 2018 — 1:00 PM EDT

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:

Wednesday, August 15, 2018 — 1:30 PM EDT

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

Tuesday, August 14, 2018 — 4:00 PM to 5:00 PM EDT

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

Monday, August 13, 2018 — 10:00 AM EDT

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. 

Friday, August 10, 2018 — 2:00 PM EDT

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

Thursday, August 9, 2018 — 3:00 PM EDT

Aiman Erbad, Computer Science and Engineering Department
Qatar University

Thursday, August 9, 2018 — 10:00 AM EDT

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.

Tuesday, August 7, 2018 — 10:30 AM EDT

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.

Friday, August 3, 2018 — 11:00 AM EDT

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

Friday, August 3, 2018 — 11:00 AM EDT

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. 

Friday, August 3, 2018 — 10:00 AM EDT

Shahin Rahbariasl, Master’s candidate
David R. Cheriton School of Computer Science

Wednesday, August 1, 2018 — 2:00 PM EDT

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.

Wednesday, August 1, 2018 — 1:30 PM EDT

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.

S M T W T F S
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
  1. 2019 (145)
    1. August (1)
    2. July (1)
    3. June (23)
    4. May (23)
    5. April (32)
    6. March (25)
    7. February (16)
    8. January (24)
  2. 2018 (221)
    1. December (16)
    2. November (19)
    3. October (26)
    4. September (23)
    5. August (17)
    6. July (20)
    7. June (13)
    8. May (25)
    9. April (34)
    10. March (24)
    11. February (3)
    12. January (1)
  3. 2017 (36)
  4. 2016 (21)
  5. 2015 (36)
  6. 2014 (33)
  7. 2013 (23)
  8. 2012 (4)
  9. 2011 (1)
  10. 2010 (1)
  11. 2009 (1)
  12. 2008 (1)