Seminar

Lily Wang, University of Waterloo

A classical problem asks us to find, for each element $A[i]$ of an array of integers, the position of the nearest smallest element. Similarly, we can ask about the dual problem: for each element of an array of integers $A[i]$, what is the position of the furthest smaller element? 

Kyle Jamieson
Department of Computer Science, Princeton University

Indexing is a game of tradeoffs: Organize your data now and be rewarded with lower read latencies later. The question of whether, how, or when to organize has led to a proliferation of many different, often highly-specialized index structures.

Hung Viet Pham, PhD candidate
David R. Cheriton School of Computer Science

Fatema Tuz Zohora, PhD candidate
David R. Cheriton School of Computer Science

Aarti Malhotra, PhD candidate
David R. Cheriton School of Computer Science

We investigate a deep learning approach to classify emotions in group-level photos into three categories: (1) positive; (2) neutral; and (3) negative. 

Sarah Roberts, Department of Information Studies
Graduate School of Education & Information, UCLA

Vijay Ganesh, Department of Electrical and Computer Engineering
University of Waterloo

Joachim von zur Gathen
University of Bonn

Meng Tang, PhD candidate
David R. Cheriton School of Computer Science