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:
Wednesday, March 31, 2021 12:00 pm - 12:00 pm EDT (GMT -04:00)

PhD Seminar • Data Systems — Evaluating Complex Queries on Streaming Graphs

Please note: This PhD seminar will be given online.

Anil Pacaci, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Tamer Özsu

Modern applications in many domains now operate on high-speed streaming graphs that continuously evolve at high rates. Efficient querying of these streaming graphs is a crucial task for applications that monitor complex patterns and relationships. 

Tuesday, April 6, 2021 12:00 pm - 12:00 pm EDT (GMT -04:00)

Seminar • Machine Learning — Towards Unsupervised 3D Deep Learning

Please note: This seminar will be given online.

Andrea Tagliasacchi, Research Scientist
Google Brain

It is not uncommon to think of computer graphics and computer vision as loosely disconnected disciplines; the former dealing with the synthesis of visual phenomena and the latter with analysis. However, recent advances in deep learning have blurred the boundary between the two. As a consequence, the research path to develop algorithms that effectively interpret the 3D scene “behind” an image has never seemed so well within reach.

Wednesday, April 7, 2021 1:00 pm - 1:00 pm EDT (GMT -04:00)

PhD Defence • Data Structures and Algorithms — Efficient Data Structures for Partial Orders, Range Modes, and Graph Cuts

Please note: This PhD defence will be given online.

Bryce Sandlund, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor J. Ian Munro

This thesis considers the study of data structures from the perspective of the theoretician, with a focus on simplicity and practicality. We consider both the time complexity as well as space usage of proposed solutions. Topics discussed fall in three main categories: partial order representation, range modes, and graph cuts.