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

Bridges Lecture — Recursion: The loops that make the world go round

bridges recursion poster

What are we? By what processes and patterns did we originate and how do these patterns compare to the processes of the world around us, digital and biological, societal and fictional?

Thursday, March 22, 2018 10:30 am - 10:30 am EDT (GMT -04:00)

Seminar • Human-Computer Interaction — Changing the Relationship People Have with Data: Towards Authoring Tools for Creating and Sharing Personal Data Visualizations

Charles Perin, Department of Computer Science
City, University of London

We live in an increasingly data-driven world, where commercial, societal, environmental, and political decisions are made based on data. However, we also live in a world where most people lack the literacy required to participate in the data-informed debates of modern society. Perhaps the main barrier to improving people’s data literacy is that data is often associated with complexity, large scale, corporatism, and dystopia.

But data is about people.

Wednesday, March 28, 2018 10:30 am - 10:30 am EDT (GMT -04:00)

Seminar • Cryptography, Security, and Privacy — Breaking Cryptographic Barriers

Dakshita Khurana, PhD candidate
Department of Computer Science, UCLA

Can we provably immunize protocols against coordinated attacks on the internet? Can we verify that computation is performed correctly while preserving the privacy of underlying data? Can we enable mutually distrusting participants to securely compute on distributed private data?

These are some of the core challenges that lie at the heart of modern cryptography and secure protocol design.

Wednesday, April 4, 2018 1:30 pm - 1:30 pm EDT (GMT -04:00)

PhD Seminar • Algorithms and Complexity: Succinct Color Searching in One Dimension

Hicham El-Zein, PhD candidate
David R. Cheriton School of Computer Science

We present succinct data structures for one-dimensional color reporting and color counting problems. We are given a set of $n$ points with integer coordinates in the range $[1,m]$ and every point is assigned a color from the set $\{\,1,\ldots,\sigma\,\}$. A color reporting query asks for the list of distinct colors that occur in a query interval $[a,b]$ and a color counting query asks for the number of distinct colors in $[a,b]$.