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, July 18, 2018 1:30 pm - 1:30 pm EDT (GMT -04:00)

Seminar • Algorithms and Complexity— Additive Number Theory via Approximation by Regular Languages

Finn Lidbetter, Master’s candidate
David R. Cheriton School of Computer Science

The fundamental problem of additive number theory is to determine whether there exists an integer m such that every nonnegative integer (resp., every sufficiently large nonnegative integer) is the sum of at most m elements of S. If so, we call S an additive basis of order m (resp., an asymptotic additive basis of order m). If such an m exists, we also want to find the smallest such m.

Friday, July 20, 2018 9:30 am - 9:30 am EDT (GMT -04:00)

PhD Seminar • Bioinformatics Group — TwitSong: The Evolution of a Poetry Generator

Carolyn Lamb, PhD candidate
David R. Cheriton School of Computer Science

We describe three versions of TwitSong, a system that generates poetry based on the news. TwitSong is designed to make aesthetic decisions about potential lines of poetry and, in the third version, to edit its own work. We describe how the system was developed, how it performs in user studies, and why this type of computer-generated poetry still has a long way to go.

Tuesday, July 24, 2018 2:00 pm - 2:00 pm EDT (GMT -04:00)

PhD Seminar • Artificial Intelligence — Gradient-based Filter Design for the Dual-tree Wavelet Transform

Daniel Recoskie, PhD candidate
David R. Cheriton School of Computer Science

The wavelet transform has seen success when incorporated into neural network architectures, such as in wavelet scattering networks. More recently, it has been shown that the dual-tree complex wavelet transform can provide better representations than the standard transform. 

Wednesday, July 25, 2018 1:30 pm - 1:30 pm EDT (GMT -04:00)

Seminar • Algorithms and Complexity — Drawing Planar Graphs with Few Geometric Primitives: Algorithms and Evaluation

Philipp Kindermann, Postdoctoral Fellow
David R. Cheriton School of Computer Science

The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear incident edges.