Subsets and Supermajorities - Optimal Hashing-based Set Similarity Search

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.