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
Concept
Universal hashing
Applied sciences
Computer engineering
Computer security
Hash functions
Graph Chatbot
Related lectures (31)
Login to filter by course
Login to filter by course
Reset
Data Summarization: Minhashing and Locality-Sensitive Hashing
Explores Jaccard similarity, minhashing, and locality-sensitive hashing for data summarization.
Implementation of Sets: Hashing
Covers the implementation of sets using hashing and set operations.
Privacy-Preserving Data Management: Intro and Secure Operations
Covers the motivation behind privacy-preserving data management and the intersection protocol for secure operations across private databases.
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.
Information Retrieval Indexing: Part 1
Explores text retrieval systems, inverted files, addressing granularity, and access structures in information retrieval.
Hash Functions: SandboxFlippedClass
Explores hash functions, coding, and sharing code with practical exercises and discussions.
Two-Phase Construction: Arrays & Hash Tables
Explains two-phase construction for arrays, hash tables, and search trees in parallel.
Near Neighbors Retrieval: Efficient Techniques
Covers techniques for efficiently retrieving similar items using similarity search queries.
Implementation of Sets (II)
Covers the implementation of sets using a naive approach and discusses the inefficiencies of the S list 7 class.
Abusive Data Collection: Risks and Protections
Explores risks of abusive data collection, protections like Differential Privacy, Hashing, and Encryption, and techniques for data protection.
Total Functions: How and Why
Explores hash table efficiency, total functions in code modeling, and well-founded relations for recursive function termination.
Previous
Page 2 of 2
Next