Undergraduate Prerequisites: CDSDS110 OR CASCS111 OR ENGEK125 OR equivalent; CDSDS320 OR CASCS330 O R ENGEC330 OR equivalent; CDSDS121 OR CASCS132 OR CASMA242 OR equivale nt; CASMA115 OR CASCS327 OR ENGEK381 OR equivalent, OR conse - Growing amounts of available data lead to significant challenges in processing them efficiently. In many cases, it is no longer possible to design feasible algorithms that can freely access the entire data set. Instead of that we often have to resort to techniques that allow for reducing the amount of data such as sampling, sketching, dimensionality reduction, and core sets. Apart from these approaches, the course will also explore scenarios in which large data sets are distributed across several machines or even geographical locations and the goal is to design efficient communication protocols or MapReduce algorithms. The course will include a final project and programming assignments in which we will explore the performance of our techniques when applied to publicly available data sets.
SPRG 2026 Schedule
| Section |
Instructor |
Location |
Schedule |
Notes |
| A1 |
Onak |
CAS 208 |
MW 10:10 am-11:55 am |
|
SPRG 2026 Schedule
| Section |
Instructor |
Location |
Schedule |
Notes |
| A2 |
Onak |
CAS 325 |
W 1:25 pm-2:15 pm |
|
SPRG 2026 Schedule
| Section |
Instructor |
Location |
Schedule |
Notes |
| A3 |
Onak |
CAS 325 |
W 2:30 pm-3:20 pm |
|
Note that this information may change at any time. Please visit the MyBU Student Portal for the most up-to-date course information.