Master’s Thesis Presentation • Data Systems — Multiple Continuous Subgraph Query Optimization Using Delta Subgraph
Chathura Kankanamge, Master’s candidate
David R. Cheriton School of Computer Science
Chathura Kankanamge, Master’s candidate
David R. Cheriton School of Computer Science
Mohammad Sadoghi
University of California, Davis
Anonymization with Differential Privacy • Ben Weggenmann
SAP Security Research
Woojung Kim, Master’s candidate
David R. Cheriton School of Computer Science
Ankit Vadehra, Master’s candidate
David R. Cheriton School of Computer Science
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.
Peiyuan Liu, Master’s candidate
David R. Cheriton School of Computer Science
Amira Ghenai, PhD candidate
David R. Cheriton School of Computer Science
Donald E. Knuth
Professor Emeritus of The Art of Computer Programming
Stanford University
Abstract: The speaker will answer any question on any subject.
The Vector Institute drives excellence and leadership in Canada’s knowledge, creation and use of artificial intelligence to foster economic growth and improve the lives of Canadians. The institute is dedicated to the transformative field of artificial intelligence, excelling in machine and deep learning research.