Simon Fraser University

A challenge in descriptive complexity is to identify logics with low complexity that simultaneously express both fundamental reachability properties and counting properties on unordered structures. In this talk, we introduce a family of logics that...

Neural networks are remarkable families of non-linear functions that form the backbone for state-of-the-art algorithms in tasks from computer vision (self-driving cars), natural language processing (Google Translate) and reinforcement learning...

This talk will focus on two topics in the foundations of neural networks: computability and false structures. In the first part I will recall briefly the concept of recursive functions and then discuss the gap between existence results, the...

We consider the problem of answering queries about formulas of first-order logic based on background knowledge partially represented explicitly as other formulas, and partially represented as examples independently drawn from a fixed probability...

In this first talk out of two, I will review various well-known algorithms for integer multiplication, such as schoolbook multiplication, Karatsuba multiplication, FFT multiplication, and the Schoenhage-Strassen algorithm. The talk will also be an...

This is the second of a two-part talk. In talk one, I will review various well-known algorithms for integer multiplication, such as schoolbook multiplication, Karatsuba multiplication, FFT multiplication, and the Schoenhage-Strassen algorithm. The...

Computational modelling can be used to reveal insights into the mechanisms of new drugs and to develop new diagnostic tools. Here I will discuss three major diseases: diabetes, hypertension, and autism. I will talk about how we construct models to...

What is a game? Mathematically speaking, a game has players, strategies and scores to explain why the players win or lose. Games which are modelled with differential equations are called differential games. Common examples are pursuit-evasion games...

Integer programming is one of the most fundamental problems in discrete optimization. While integer programming is computationally hard in general, there exist efficient algorithms for special instances. In particular, integer programming is fixed...