Seminar • Algorithms and Complexity • Sorting and Selection in Rounds with Adversarial Comparisons
Please note: This seminar will take place in DC 1304 and online.
Chris Trevisan, Undergraduate student
David R. Cheriton School of Computer Science
Chris Trevisan, Undergraduate student
David R. Cheriton School of Computer Science
Maxime Roland René Flin
Reykjavik University, Iceland
Xueguang Ma, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Jimmy Lin
Neural retrieval systems have proven effective across a range of tasks and languages. However, creating fully zero-shot neural retrieval pipeline remains a challenge when relevance labels are not available.
Benyamin Jamialahmadi, Master’s candidate
David R. Cheriton School of Computer Science
Supervisors: Professors Ali Ghodsi, Mohammad Kohandel
Prabhjot Singh, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Diogo Barradas
Although encrypted channels, like those provided by anonymity networks such as Tor, have been put into effect, network adversaries have proven their capability to undermine users’ browsing privacy through website fingerprinting attacks.
Fadhil Abubaker, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Khuzaima Daudjee
Seba Khaleel, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Samer Al-Kiswany
Adrian Cruzat La Rosa, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Diogo Barradas
Ben Armstrong, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Kate Larson
We present our work using machine learning models to approximate social choice functions, a.k.a. methods of voting. Voting rules are functions that are given voter preferences and produce a winning candidate.
Sonja Linghui Shan, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Jeffrey Shallit