Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Data Summarization: Minhashing and Locality-Sensitive Hashing
Graph Chatbot
Related lectures (32)
Previous
Page 1 of 4
Next
Data Compression: Privacy-Preserving Techniques
Explores privacy-preserving data management and data summarization techniques for finding similar items.
Hashing and Sorting Techniques in Database Systems
Provides an overview of hashing and sorting techniques in database management systems, focusing on their implementation and performance optimization.
Hash Tables: Running Time Analysis
Explores the analysis of running time in hash tables, covering successful searches, key distribution, and table size impact.
Probabilistic Analysis: Hiring & Birthday Paradox
Explores probabilistic analysis in algorithms, covering the hiring problem and the birthday paradox, along with hash tables and functions.
Hash Tables: Birthday Paradox
Explores hash tables through the Birthday Paradox, collisions, and implementation methods.
Implementation of Sets (II)
Covers the implementation of sets using a naive approach and discusses the inefficiencies of the S list 7 class.
Cryptographic Hash Functions and Block Chains
Covers cryptographic hash functions, message authentication codes, and block chains, including bitcoins, proof-of-work, and MAC variants.
Implementation of Sets: Hashing
Covers the implementation of sets using hashing and set operations.
Hashing: Basics and Applications
Explores hashing fundamentals, applications in security, and common attacks on hash functions.
Locality Sensitive Hashing
Explores Locality Sensitive Hashing for nearest neighbor search and submodularity in hash functions.