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
Locality Sensitive Hashing
Graph Chatbot
Related lectures (32)
Previous
Page 1 of 4
Next
Nearest Neighbor Search: Johnson-Lindenstrauss Lemma
Covers the Nearest Neighbor search algorithm and the Johnson-Lindenstrauss lemma for dimensionality reduction, exploring preprocessing techniques and locality-sensitive hashing.
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.
Pairwise Independence: Hashing and Load Balancing
Explores pairwise independence in hashing to avoid collisions and achieve load balancing.
Hash Tables: Running Time Analysis
Explores the analysis of running time in hash tables, covering successful searches, key distribution, and table size impact.
Hash Tables: Birthday Paradox
Explores hash tables through the Birthday Paradox, collisions, and implementation methods.
Probabilistic Analysis: Hiring & Birthday Paradox
Explores probabilistic analysis in algorithms, covering the hiring problem and the birthday paradox, along with hash tables and functions.
Decentralized Systems Engineering: Chord DHT
Covers the Chord DHT in decentralized systems engineering, focusing on reliability, redundancy, and structure maintenance.
Hash Functions and Tables
Introduces hashing tables, including the Birthday Lemma, Direct-Address Tables, collisions, and Chained-Hash-Search.
Near Neighbors Retrieval: Efficient Techniques
Covers techniques for efficiently retrieving similar items using similarity search queries.
Hash Tables Analysis
Covers the analysis of hash tables, including search operations and expected collisions.