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
Cryptography and Hashing OverviewUniversity of California, Irvine via Coursera Learn Blockchain By Building Your Own In JavaScript
Udemy Practical Encryption and Cryptography Using Python
Pluralsight Introducción a Blockchain, Criptomonedas y Smart Contracts
Udemy Cryptography: Learn Public Key Infrastructure from Scratch
Udemy