Media Summary: Symmetrization, hashing: linear probing (5-wise indep.), bloom filters, cuckoo hashing, bloomier filters. Power of random signs: ℓ2 norm estimation, subspace embeddings (regression), Johnson-Lindenstrauss, deterministic point ... Hashing: load balancing, k-wise independence, chaining, linear probing.
Advanced Algorithms Compsci 224 Lecture 21 - Detailed Analysis & Overview
Symmetrization, hashing: linear probing (5-wise indep.), bloom filters, cuckoo hashing, bloomier filters. Power of random signs: ℓ2 norm estimation, subspace embeddings (regression), Johnson-Lindenstrauss, deterministic point ... Hashing: load balancing, k-wise independence, chaining, linear probing. Logistics, course topics, word RAM, predecessor, van Emde Boas, y-fast tries. Please see Problem 1 of Assignment 1 at ... Preferred path decomposition, link-cut trees. Linear programming via multiplicative weights, flows, augmenting paths.
As the John L. Loeb Associate Professor of Engineering and Applied Sciences at the Harvard John A. Paulson School of ... ℓ1/ℓ1 recovery, RIP1, unbalanced expanders, Sequential Sparse Matching Pursuit.
