University COVID-19 update

The University of Waterloo is constantly updating our most Frequently Asked Questions.

Questions about buildings and services? Visit the list of Modified Services.

Please note: The University of Waterloo is closed for all events until further notice.

Events - December 2019

Thursday, December 12, 2019 — 3:00 PM EST

Title: OutFn, M_gn and renormalized topological field theory

Speaker: Michael Borinsky
Affiliation: Nikhef
Room: MC 5417

Abstract:

I will report on recent joint work with Karen Vogtmann on the Euler characteristic of Out(F_n) and the moduli space of graphs.

Thursday, December 12, 2019 — 1:00 PM EST

Title: Graph covers with two new eigenvalues

Speaker: Olha Silina
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

I am going to talk about graph covers. If $Y$ is a cyclic cover of $X$, it turns out that $Y$ has the same spectrum as $X$ plus (possibly) some new eigenvalues. 

Friday, December 6, 2019 — 3:03 PM EST

Title: Biometric security: Design, implementation, and challenges

Speaker: Koray Karabina
Affiliation: Florida Atlantic University
Room: MC 5501

Abstract:

Biometric based cybersecurity technologies offer significant advantages in authentication, identification, and access control mechanisms.

Thursday, December 5, 2019 — 3:00 PM EST

Title: Inverses of Trees

Speaker: Krystal Guo
Affiliation: Centre de Recherches Mathématiques & Université de Montréal
Room: MC 5417

Abstract:

A tree is invertible if and only if it has a perfect matching.

Godsil considers an invertible tree T and finds that the inverse of the adjacency matrix has entries in {0, ±1} and is the signed adjacency matrix of a graph which contains T.

Thursday, December 5, 2019 — 9:30 AM EST

Title: How can we optimize nonsmooth objectives globally?

Speaker: Andreas Griewank
Affiliation: Humboldt University, Germany
Room: MC 5501

Abstract:

In machine learning objective functions that are only piecewise smooth and should be globally minimized abound. The standard method of dealing with them is to apply a stochastic gradient method disregarding the rare points of nonsmoothness and hoping for the best as far as global optimality of the computed solution is concerned.

S M T W T F S
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
  1. 2020 (101)
    1. November (1)
    2. October (10)
    3. September (12)
    4. August (11)
    5. July (17)
    6. June (11)
    7. May (6)
    8. March (11)
    9. February (11)
    10. January (11)
  2. 2019 (167)
    1. December (5)
    2. November (15)
    3. October (18)
    4. September (15)
    5. August (9)
    6. July (17)
    7. June (18)
    8. May (16)
    9. April (9)
    10. March (24)
    11. February (13)
    12. January (8)
  3. 2018 (136)
  4. 2017 (103)
  5. 2016 (137)
  6. 2015 (136)
  7. 2014 (88)
  8. 2013 (48)
  9. 2012 (39)
  10. 2011 (36)
  11. 2010 (40)
  12. 2009 (40)
  13. 2008 (39)
  14. 2007 (15)