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, January 21, 2015 9:30 am - 9:30 am EST (GMT -05:00)

Seminar - Cristobal Guzman

Complexity in Convex Optimization: Oracles, Algorithms and Applications

Speaker: Cristobal Guzman
Affiliation: Georgia Institute of Technology
Room: Mathematics and Computer Building (MC) 5417

Abstract: 

The need to solve large-scale optimization problems is ubiquitous. Modern applications in signal processing, machine learning and big data, need at their core convex optimization solvers.

Wednesday, January 21, 2015 3:30 pm - 3:30 pm EST (GMT -05:00)

Graph theory seminar - Arash Haddadan

Barnette's conjecture and TSP tours in Barnette Graphs

Speaker: Arash Haddadan
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 6486

Abstract:

Barnette's conjecture states that every 3-connected, planar, cubic, bipartite graph is Hamiltonian. After 45 years Barnette's conjecture is not yet settled.

Friday, January 23, 2015 9:30 am - 9:30 am EST (GMT -05:00)

Seminar - Damek Davis

The design and analysis of large-scale operator-splitting schemes

Speaker: Damek Davis
Affiliation:
University of California, Los Angeles (UCLA)
Room: Mathematics and Computer Building (MC) 5417

Abstract:

Continuous optimization is a key component of modern data analysis.

Monday, January 26, 2015 9:30 am - 9:30 am EST (GMT -05:00)

Seminar - Quoc Tran-Dinh

Structured smoothness in modern convex optimization

Speaker: Quoc Tran-Dinh
Affiliation: EPFL, Switzerland
Room: Mathematics and Computer Building (MC) 5417

Abstract:

The importance of convex optimization techniques has dramatically increased in the last decade due to the rise of new theory for
structured sparsity and low-rankness, and successful statistical

Friday, January 30, 2015 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte seminar - David Wagner

High order correlation inequalities for random spanning trees

Speaker: David Wagner
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5479

Abstract: 

A (finite) point process is just a probability measure on the set of all subsets of a finite set. Ursell functions occur naturally in statistical mechanics, and for point processes they have a very simple form.

Wednesday, February 4, 2015 3:30 pm - 3:30 pm EST (GMT -05:00)

Graph theory seminar - Kanstantsin Pashkovich

Polytopes of minimum positive semidefinite rank

Speaker: Kanstantsin Pashkovich
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 6486

Abstract:

For a given polytope the smallest size of a semidefinite extended formulation can be bounded from below by the dimension of the polytope plus one. This talk is about polytopes for which this bound is tight, i.e.

Thursday, February 5, 2015 1:30 pm - 1:30 pm EST (GMT -05:00)

Algebraic combinatorics seminar - Huangjun Zhu

Super-symmetric informationally complete measurements

Speaker: Huangjun Zhu
Affiliation: Perimeter Institute
Room: Mathematics 3 (M3) 2134

Abstract:

Symmetric informationally complete measurements (SICs) are highly symmetric structure in the Hilbert space. They possess many nice properties which render them an ideal candidate of fiducial measurements.

Friday, February 6, 2015 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte seminar - Daniel Panario

Analytic and probabilistic combinatorics for polynomials over finite fields

Speaker: Daniel Panario
Affiliation: University of Waterloo
Room: William G. Davis Computer Research Centre (DC) 1302

Abstract: 

The central objects of this talk are univariate polynomials over finite fields.

Thursday, February 12, 2015 12:00 pm - 12:00 pm EST (GMT -05:00)

Algebraic combinatorics seminar - Cameron Marcott

A Super Technical Lemma

Speaker: Cameron Marcott
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5426

Abstract:

I will present a technical lemma about extending matrix algebras by an idempotent. There will be no movie references, fun, or combinatorics.