Algorithms for Big Data (COMPSCI 229r), Lecture 10

Algorithms for Big Data (COMPSCI 229r), Lecture 10 Harvard University explores streaming algorithm space lower bounds using communication complexity. The discussion transitions from proving these bounds for problems like distinct elements and disjointness to introducing dimensionality reduction as a method for managing high-dimensional data in large-scale geometric optimization tasks.