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, March 31, 2021 12:00 pm - 12:00 pm EDT (GMT -04:00)

PhD Seminar • Data Systems — Evaluating Complex Queries on Streaming Graphs

Please note: This PhD seminar will be given online.

Anil Pacaci, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Tamer Özsu

Modern applications in many domains now operate on high-speed streaming graphs that continuously evolve at high rates. Efficient querying of these streaming graphs is a crucial task for applications that monitor complex patterns and relationships. 

Tuesday, April 6, 2021 12:00 pm - 12:00 pm EDT (GMT -04:00)

Seminar • Machine Learning — Towards Unsupervised 3D Deep Learning

Please note: This seminar will be given online.

Andrea Tagliasacchi, Research Scientist
Google Brain

It is not uncommon to think of computer graphics and computer vision as loosely disconnected disciplines; the former dealing with the synthesis of visual phenomena and the latter with analysis. However, recent advances in deep learning have blurred the boundary between the two. As a consequence, the research path to develop algorithms that effectively interpret the 3D scene “behind” an image has never seemed so well within reach.

Wednesday, April 14, 2021 1:00 pm - 1:00 pm EDT (GMT -04:00)

Seminar • Algorithms and Complexity — An Optimal Separation of Randomized and Quantum Query Complexity

Please note: This seminar will be given online.

Pei Wu, Computer Science Department
University of California, Los Angeles

We prove that for every decision tree, the absolute values of the Fourier coefficients of given order $\ell\geq1$ sum to at most $c^{\ell}\sqrt{\binom{d}{\ell}(1+\log n)^{\ell-1}},$ where $n$ is the number of variables, $d$ is the tree depth, and $c>0$ is an absolute constant. This bound is essentially tight and settles a conjecture due to Tal (arxiv 2019; FOCS 2020).