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
Hash table
Applied sciences
Computer engineering
Computer security
Hash functions
Graph Chatbot
Related lectures (32)
Login to filter by course
Login to filter by course
Reset
Previous
Page 4 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.
Collections: Associative Tables
Covers associative tables, Map interface methods, key/value pairs, and HashMap vs. TreeMap differences.