Similarity Search Seminar Spring 18
Fridays / 10:00 - 11:00 / DIKU room 1-0-04
Topics
Recent theoretical results related to similarity search. Simple papers with approachable open problems are appreciated. PhD students who participate actively will receive a diploma from ITU’s PhD school (approx. 2 ECTS).
Example keywords: Dimensionality reduction, sketching, clustering, isoperimetric inequalities, locality-sensitive hashing, fine-grained complexity, approximate and exact near neighbor search.
Schedule (tentative)
Date | Presenser | Paper |
9/2 | Tobias | The distortion of locality-sensitive hashing |
16/2 | Rasmus | Fast Locality-sensitive Hashing for Approximate Neighbor Search |
23/2 | - | Break |
2/3 | Ninh | Hashing-Based-Estimators for Kernel Density in High Dimentions |
9/3 | TBA | TBA |
16/3 | TBA | TBA |
23/3 | TBA | TBA |
30/3 | - | Good Friday |
6/4 | - | ARCO workshop |
13/4 | TBA | TBA |
20/4 | TBA | TBA |
27/4 | TBA | TBA |
Participants
Alan Roytman
Andreas Björklund
Jakob Bæk Tejs Knudsen
Johan Sivertsen
Martin Aumüller
Nina Stausholm Nielsen
Ninh Pham
Rasmus Pagh
Sam McCauley
Stephen Alstrup
Thore Husfeldt
Tobias Christiani