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, August 29, 2018 1:30 pm - 1:30 pm EDT (GMT -04:00)

Seminar • Algorithms and Complexity — Counting Subwords and Regular Languages

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. 

Thursday, September 13, 2018 1:30 pm - 1:30 pm EDT (GMT -04:00)

Master’s Thesis Presentation • Artificial Intelligence — Predicting Short-Term Water Consumption for Multi-Family Residences

Irish Medina, Master’s candidate
David R. Cheriton School of Computer Science

Smart water meters have been installed across Abbotsford, British Columbia, Canada, to measure the water consumption of households in the area. Using this water consumption data, we develop machine learning and deep learning models to predict daily water consumption for existing multi-family residences. We also present a new methodology for predicting the water consumption of new housing developments. 

Friday, September 14, 2018 1:00 pm - 1:00 pm EDT (GMT -04:00)

Master’s Thesis Presentation • Scientific Computation — Fast Algorithms for Finding the Characteristic Polynomial of a Rank 2 Drinfeld Module

Yossef Musleh, Master’s candidate
David R. Cheriton School of Computer Science

We introduce a Monte Carlo randomized algorithm for computing the characteristic polynomial of a rank 2 Drinfeld module than runs in $O(n^2 \log n \log \log n \log q)$ field operations. We also introduce a deterministic algorithm that runs in $O(n^{2.6258} \log n + n^2 \log n \log log n \log q)$ field operations. Both approaches are a significant improvement over the current literature.