Introduction to Advanced Algorithms Compsci 224 Lecture 9
Exploring Advanced Algorithms Compsci 224 Lecture 9 reveals several interesting facts. Randomized paging, packing/covering linear programs, weak duality, approximate complementary slackness, primal/dual online ...
Advanced Algorithms Compsci 224 Lecture 9 Comprehensive Overview
Online primal/dual: e/(e-1) ski rental, set cover; approximation Power of random signs: ℓ2 norm estimation, subspace embeddings (regression), Johnson-Lindenstrauss, deterministic point ... Guest
Summary & Highlights for Advanced Algorithms Compsci 224 Lecture 9
- Online
- Hashing: load balancing, k-wise independence, chaining, linear probing.
- Symmetrization, hashing: linear probing (5-wise indep.), bloom filters, cuckoo hashing, bloomier filters.
- second order methods (Newton's method), path-following interior point wrap-up.
- Advanced Algorithms 9/9/2014
Stay tuned for more updates related to Advanced Algorithms Compsci 224 Lecture 9.