Seminar • Algorithms and Complexity • Computability and Complexity in Analytic Combinatorics
Please note: This seminar will take place in DC 1302 and online.
Steve Melczer, Assistant Professor
Department of Combinatorics and Optimization
Steve Melczer, Assistant Professor
Department of Combinatorics and Optimization
Yaxin Cheng, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Chengnian Sun
Shannon Veitch, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: University Professor Doug Stinson
Michael Abebe, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Khuzaima Daudjee
Junqiao Lin, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Richard Cleve
Dake Zhang, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Mark Smucker
Emily Lepert, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Florian Kerschbaum
We examine the problem of providing differential privacy for nearest neighbor queries. Very few mechanisms exist that achieve this, most notable geo-indistinguishability in the context of location privacy. However it uses an extended definition of differential privacy and restricts the sensitivity of queries.
Nathan Harms, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Eric Blais
Ege Ciklabakkal, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Toshiya Hachisuka
Mohammad Dehghan, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Lukasz Golab
Text simplification is a task in the natural language processing field that alters a given text to reduce the structural and lexical complexity of the text while preserving the underlying meaning.