Adam Molnar, Deakin University
Anna Lubiw
David R. Cheriton School of Computer Science
In this talk I will look at geometric graph representations from the perspective of three issues: the algorithmic complexity of finding a representation; the bit complexity of the representation; and whether there is a morph between any two combinatorially equivalent representations.
Mohammad Sadoghi
University of California, Davis
Yaron Minsky, Technology Group Head
Jane Street
Electronic exchanges play an important role in the world’s financial system, acting as focal points where actors from across the world meet to trade with each other.
But building an exchange is a difficult technical challenge, requiring high transaction rates, low, deterministic response times, and serious reliability.
Yaron Minsky, Technology Group Head
Jane Street
Trading in financial markets is a data-driven affair, and as such, it requires applications that can efficiently filter, transform and present data to users in real time.
But there's a difficult problem at the heart of building such applications: finding a way of expressing the necessary transformations of the data in a way that is simultaneously easy to understand and efficient to execute over large streams of data.
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.
Amira Ghenai, PhD candidate
David R. Cheriton School of Computer Science
Anonymization with Differential Privacy • Ben Weggenmann
SAP Security Research
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.
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.