Subsets and Supermajorities - Optimal Hashing-based Set Similarity Search
Offered By: IEEE via YouTube
Course Description
Overview
Explore an in-depth IEEE conference talk on optimal hashing-based set similarity search, focusing on subsets and supermajorities. Delve into the research presented by Thomas D. Ahle from BARC, IT University of Copenhagen, and Jakob B. T. Knudsen from BARC, University of Copenhagen. Gain insights into their findings, methodologies, and implications for set similarity search algorithms in this 24-minute presentation based on their paper available on arXiv.
Syllabus
Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search.
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Automata TheoryStanford University via edX Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera How to Win Coding Competitions: Secrets of Champions
ITMO University via edX Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera