Start Here
Begin with broad courses that introduce the fundamentals before moving into focused lessons.
Learn 229R
Free 229R courses, lessons, transcripts, and guided learning paths on CourseHive.
Free 229R Courses
229R Learning Paths
Practice Concepts
Use lesson transcripts and key concepts to review specific ideas and reinforce your understanding.
Go Deeper
Follow related courses and topic links to build a wider learning path around 229R.
Build your 229R habit in the app
Browse courses, revisit transcripts, and continue learning on Android or iOS.
229R Lessons With Transcripts
Algorithms for Big Data (COMPSCI 229r), Lecture 25
MapReduce: TeraSort, minimum spanning tree, triangle counting.
Algorithms for Big Data (COMPSCI 229r)Algorithms for Big Data (COMPSCI 229r), Lecture 24
Competitive paging, cache-oblivious algorithms: matrix multiplication, self-organizing linked list, static B-tree, lazy funnelsort.
Algorithms for Big Data (COMPSCI 229r)Algorithms for Big Data (COMPSCI 229r), Lecture 23
External memory model: linked list, matrix multiplication, B-tree, buffered repository tree, sorting.
Algorithms for Big Data (COMPSCI 229r)Algorithms for Big Data (COMPSCI 229r), Lecture 22
Matrix completion.
Algorithms for Big Data (COMPSCI 229r)Algorithms for Big Data (COMPSCI 229r), Lecture 21
ℓ1/ℓ1 recovery, RIP1, unbalanced expanders, Sequential Sparse Matching Pursuit.
Algorithms for Big Data (COMPSCI 229r)Algorithms for Big Data (COMPSCI 229r), Lecture 20
Krahmer-Ward proof, Iterative Hard Thresholding.
Algorithms for Big Data (COMPSCI 229r)Algorithms for Big Data (COMPSCI 229r), Lecture 19
RIP and connection to incoherence, basis pursuit, Krahmer-Ward theorem.
Algorithms for Big Data (COMPSCI 229r)Algorithms for Big Data (COMPSCI 229r), Lecture 18
Low-rank approximation, column-based matrix reconstruction, k-means, compressed sensing.
Algorithms for Big Data (COMPSCI 229r)Algorithms for Big Data (COMPSCI 229r), Lecture 17
Oblivious subspace embeddings, faster iterative regression, sketch-and-solve regression.
Algorithms for Big Data (COMPSCI 229r)Algorithms for Big Data (COMPSCI 229r), Lecture 16
Linear least squares via subspace embeddings, leverage score sampling, non-commutative Khintchine, oblivious subspace embeddings.
Algorithms for Big Data (COMPSCI 229r)Algorithms for Big Data (COMPSCI 229r), Lecture 15
Approximate matrix multiplication with Frobenius error via sampling / JL, matrix median trick, subspace embeddings.
Algorithms for Big Data (COMPSCI 229r)Algorithms for Big Data (COMPSCI 229r), Lecture 14
Sparse JL proof wrap-up, Fast JL Transform, approximate nearest neighbor.
Algorithms for Big Data (COMPSCI 229r)229R Key Concepts
229R FAQs
Where can I learn 229R for free?
CourseHive collects free 229R courses and lessons so you can start learning online without payment.
What is included on this 229R topic page?
This page groups related courses, individual lessons, transcripts, and key concepts for 229R.
How should I choose a 229R course?
Start with a course that matches your level, then use related lessons and transcripts to review specific concepts.