THIS SITE

Information for

Events

Wednesday, November 14, 2018 — 12:15 PM EST

Amine Mhedhbi, PhD candidate
David R. Cheriton School of Computer Science

We study the problem of optimizing subgraph queries (SQs) using the new worst-case optimal (WCO) join plans in Selinger-style cost-based optimizers. WCO plans evaluate SQs by matching one query vertex at a time using multiway intersections. The core problem in optimizing WCO plans is to pick an ordering of the query vertices to match. 

We make two contributions:

Thursday, November 15, 2018 — 10:00 AM EST

Jeff Avery, PhD candidate
David R. Cheriton School of Computer Science

Thursday, November 15, 2018 — 10:30 AM EST

Professor Brian Forrest
Department of Pure Mathematics, University of Waterloo

There are many challenges to teaching mathematics in a fully online environment. In this talk I will show the important role that assigned work plays in mitigating many of these challenges. I will also speak about how my experience in teaching online has impacted the way in which I approach my on campus courses.

Wednesday, November 21, 2018 — 12:15 PM EST

Hemant Saxena, PhD candidate
David R. Cheriton School of Computer Science

We address the problem of discovering dependencies from distributed big data. Existing (non-distributed) algorithms focus on minimizing computation by pruning the search space of possible dependencies. However, distributed algorithms must also optimize data communication costs, especially in current shared-nothing settings. 

Wednesday, November 21, 2018 — 1:30 PM EST

Abel Molina, PhD candidate
David R. Cheriton School of Computer Science

Yao (1993) proved that quantum Turing machines and uniformly generated quantum circuits are polynomially equivalent computational models: t >= n steps of a quantum Turing machine running on an input of length n can be simulated by a uniformly generated family of quantum circuits with size quadratic in t, and a polynomial-time uniformly generated family of quantum circuits can be simulated by a quantum Turing machine running in polynomial time.

Friday, November 23, 2018 — 1:30 PM EST

Xinan Yan, PhD candidate
David R. Cheriton School of Computer Science

Monday, November 26, 2018 — 3:30 PM EST

Robin Cohen
David R. Cheriton School of Computer Science

Friday, December 14, 2018 — 8:30 AM EST

Dhinakaran Vinayagamurthy, PhD candidate
David R. Cheriton School of Computer Science

S M T W T F S
28
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
1
  1. 2018 (198)
    1. December (1)
    2. November (11)
    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)
  2. 2017 (37)
    1. December (2)
    2. November (5)
    3. October (3)
    4. September (4)
    5. July (4)
    6. June (3)
    7. May (2)
    8. April (2)
    9. March (6)
    10. February (4)
    11. January (2)
  3. 2016 (21)
  4. 2015 (36)
  5. 2014 (33)
  6. 2013 (23)
  7. 2012 (4)
  8. 2011 (1)
  9. 2010 (1)
  10. 2009 (1)
  11. 2008 (1)