Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Locality Sensitive Hashing

Related lectures (33)

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.

Pairwise Independence: Hashing and Load Balancing

Explores pairwise independence in hashing to avoid collisions and achieve load balancing.

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 Tables Analysis

Covers the analysis of hash tables, including search operations and expected collisions.

Cryptographic Hash Functions and Block Chains

Covers cryptographic hash functions, message authentication codes, and block chains, including bitcoins, proof-of-work, and MAC variants.

Distinct Elements: Count and Hash Functions

Covers counting distinct elements using hash functions and the median trick.

Hashing: Basics and Applications

Explores hashing fundamentals, applications in security, and common attacks on hash functions.

Dictionary Operations

Covers operations and methods related to dictionaries in Python, including creating, updating, and handling key errors.

Implementation of Hash Sets

Covers the implementation details of hash sets and related methods using IntelliJ IDEA.

Implementation of Sets (II)

Covers the implementation of sets using a naive approach and discusses the inefficiencies of the S list 7 class.

Implementation of Sets: Hashing

Covers the implementation of sets using hashing and set operations.

Total Functions: How and Why

Explores hash table efficiency, total functions in code modeling, and well-founded relations for recursive function termination.

Two-Phase Construction: Arrays & Hash Tables

Explains two-phase construction for arrays, hash tables, and search trees in parallel.

Implementation of Sets (I)

Covers the implementation of sets, starting with a naive list-based approach.

Hash Functions: SandboxFlippedClass

Explores hash functions, coding, and sharing code with practical exercises and discussions.

Equality, Order, and Hashing

Explains hashing, equality, and order in Java, emphasizing method compatibility for correct collection behavior.

Hash Tables: Rehashing for Improved Performance

Explores optimizing hash tables through rehashing for improved performance.

Cryptographic Security Fundamentals

Covers cryptographic security fundamentals, including collision search algorithms, public-key cryptography, and risks of underestimating collision attacks.

Data Security: Hashing, Salting, and Password Storage

Emphasizes the significance of hashing, salting, and secure password storage in data security, highlighting the use of salt to prevent dictionary attacks and memory hard functions to slow down password cracking.