Events

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:
Friday, October 19, 2018 2:00 pm - 2:00 pm EDT (GMT -04:00)

Seminar • Systems and Networking — RFID Hacking for Fun and Profit

Ju Wang, Postdoctoral fellow
David R. Cheriton School of Computer Science

Passive radio frequency identification (RFID) tags are ubiquitous today due to their low cost (a few cents), relatively long communication range (7–11 m), ease of deployment, lack of battery, and small form factor. This talk shows how even hobbyists can transform commodity RFID tags into sensors by physically altering ('hacking') them using COTS sensors and a pair of scissors. Importantly, this requires no change to commercial RFID readers.

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

This thesis is driven by the question of how computers can generate poetry, and how that poetry can be evaluated. We survey existing work on computer-generated poetry and interdisciplinary work on how to evaluate this type of computer-generated creative product. 

Wednesday, October 24, 2018 12:15 pm - 12:15 pm EDT (GMT -04:00)

PhD Seminar • Data Systems — RDF Data Quality

Mina Farid, PhD candidate
David R. Cheriton School of Computer Science

RDF has become a prevalent format to represent disparate data that is ingested from heterogeneous sources. However, data often contains errors due to extraction, transformation, and integration problems, leading to missing or contradicting information that propagate to downstream applications. 

Wednesday, October 24, 2018 1:30 pm - 1:30 pm EDT (GMT -04:00)

Seminar • Algorithms and Complexity — The Power of Constructive Proofs

Antonina Kolokolova, Department of Computer Science
Memorial University of Newfoundland

A unifying theme in complexity theory in the past few years has been the duality between lower bounds and algorithms. Indeed, some of the main recent lower bounds have been proven by developing better algorithms. 

Ingrid Daubechies
James B. Duke Professor of Mathematics and Electrical and Computer Engineering, Duke University
2018 University of Waterloo Doctor of Mathematics, honoris causa

This inaugural Distinguished Lecture in Applied Math will be given in DC 1302, with a reception to follow in DC 1301, the Fishbowl.