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:
Monday, January 21, 2019 1:00 pm - 1:00 pm EST (GMT -05:00)

Master’s Thesis Presentation • Algorithms and Complexity — Bounds on Maximum Matchings in 1-Planar Graphs

John Wittnebel, Master’s candidate
David R. Cheriton School of Computer Science

In this thesis, we study lower bounds on maximum matchings in 1-planar graphs. We expand upon the tools used for proofs of matching bounds in other classes of graphs as well as some original ideas in order to find these bounds. The first novel results we provide are lower bounds of maximum matching in 1-planar graphs as a function of their minimum degree.

Thursday, January 24, 2019 4:00 pm - 4:00 pm EST (GMT -05:00)

Master’s Thesis Presentation • Artificial Intelligence — Applications of Artificial Intelligence to the NHL Entry Draft

Brandon Alcox, Master’s candidate
David R. Cheriton School of Computer Science

This thesis investigates the application of various fields of artificial intelligence to the domain of sports management and analysis. The research in this thesis is primarily focused on the entry draft for the National Hockey League, though many of the models proposed may be applied to other sports and leagues with minimal adjustments. 

Friday, January 25, 2019 12:30 pm - 12:30 pm EST (GMT -05:00)

PhD Defence • Institute for Quantum Computing — Formal Methods in Quantum Circuit Design

Matthew Amy, PhD candidate
David R. Cheriton School of Computer Science

The design and compilation of correct, efficient quantum circuits is integral to the future operation of quantum computers. This thesis makes contributions to the problems of optimizing and verifying quantum circuits, with an emphasis on the development of formal models for such purposes. We also present software implementations of these methods, which together form a full stack of tools for the design of optimized, formally verified quantum oracles.