Exploring Advanced Algorithms Compsci 224 Lecture 13
Exploring Advanced Algorithms Compsci 224 Lecture 13 reveals several interesting facts.
- Fusion trees, word-level parallelism, most significant set bit in constant time.
- second order methods (Newton's method), path-following interior point wrap-up.
- Online primal/dual: e/(e-1) ski rental, set cover; approximation
- More efficient exponential-time
- Power of random signs: ℓ2 norm estimation, subspace embeddings (regression), Johnson-Lindenstrauss, deterministic point ...
In-Depth Information on Advanced Algorithms Compsci 224 Lecture 13
Guest Logistics, course topics, word RAM, predecessor, van Emde Boas, y-fast tries. Please see Problem 1 of Assignment 1 at ... Hashing: load balancing, k-wise independence, chaining, linear probing. Symmetrization, hashing: linear probing (5-wise indep.), bloom filters, cuckoo hashing, bloomier filters.
Simplex wrap-up, strong duality, complementary slackness, ellipsoid, intro to interior point.
Stay tuned for more updates related to Advanced Algorithms Compsci 224 Lecture 13.
