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
Semantic Web TechnologiesopenHPI أساسيات استرجاع المعلومات
Rwaq (رواق) 《gacco特別企画》Evernoteで広がるgaccoの学びスタイル (ga038)
University of Tokyo via gacco La Web Semántica: Herramientas para la publicación y extracción efectiva de información en la Web
Pontificia Universidad Católica de Chile via Coursera 快速学习
University of Science and Technology of China via Coursera