Seminar

Andrew Beltaos / Amenda Chow
University of Waterloo / York University

Teaching via analogies builds upon students' existing knowledge. New concepts that are taught only within the context of mathematics may seem foreign to students at first glance, but if students have already learned analogous concepts elsewhere in life, as educators, we can make use of their existing framework to strengthen their learning. 

Mina Farid, PhD candidate
David R. Cheriton School of Computer Science

RDF has become a prevalent format to represent disparate data that is ingested from heterogeneous sources. However, data often contains errors due to extraction, transformation, and integration problems, leading to missing or contradicting information that propagate to downstream applications. 

Aaron Moss, PhD candidate
David R. Cheriton School of Computer Science

Kristofer Siy, Graduate student
Combinatorics and Optimization

Yaron Minsky, Technology Group Head
Jane Street

Trading in financial markets is a data-driven affair, and as such, it requires applications that can efficiently filter, transform and present data to users in real time.

But there's a difficult problem at the heart of building such applications: finding a way of expressing the necessary transformations of the data in a way that is simultaneously easy to understand and efficient to execute over large streams of data.

Yaron Minsky, Technology Group Head
Jane Street

Electronic exchanges play an important role in the world’s financial system, acting as focal points where actors from across the world meet to trade with each other.

But building an exchange is a difficult technical challenge, requiring high transaction rates, low, deterministic response times, and serious reliability.

Mohammad Sadoghi
University of California, Davis

Anonymization with Differential Privacy • Ben Weggenmann
SAP Security Research

Anna Lubiw
David R. Cheriton School of Computer Science

In this talk I will look at geometric graph representations from the perspective of three issues: the algorithmic complexity of finding a representation; the bit complexity of the representation; and whether there is a morph between any two combinatorially equivalent representations.

Amira Ghenai, PhD candidate
David R. Cheriton School of Computer Science