|
|
|
|
|
-
Lecture 1: Course Introduction, Depth First Search - 3/30/99
-
Lecture 2: Minimum Spanning Tree, Disjoint Union / Find - 4/1/99
-
Lecture 3: Prim’s Algorithm for MST, Load Balanced Spanning Tree, Hamiltonian Path - 4/6/99
-
Lecture 4: NP-Completeness - 4/8/99
-
Lecture 5: 3-Colorability, Branch and Bound - 4/13/99
-
Lecture 6: Local Search, Strong NP-Completeness, Subset Sum Algorithm - 4/15/99
-
Lecture 7: Subset Sum, Algorithm Evaluation, Mergesort - 4/20/99
-
Lecture 8: Cache Performance, Mergesort, Heapsort - 4/22/99
-
Lecture 9: Cache Conscious Heapsort, Cache Conscious Static Search - 4/27/99
-
Lecture 10: Data Compression, Information Theory - 4/29/99
-
Lecture 11: Huffman Coding, Arithmetic Coding - 5/4/99
-
Lecture 12: Arithmetic Coding, Dictionary Coding - 5/6/99
-
Lecture 13: Dictionary Coding, Sequitur - 5/11/99
-
Lecture 14: Image Compression, Vector Quantization, Nearest Neighbor Search - 5/13/99
-
Lecture 15: Nearest Neighbor Search, k-d Trees - 5/18/99
-
Lecture 16: Wavelet Compression - 5/20/99
-
Lecture 17: SPIHT Compression, Approximate String Matching - 5/25/99
-
Lecture 18: Approximate String Matching, Contiguous Ordering - PQ Trees - 5/27/99
-
Lecture 19: Contiguous Ordering - PQ Trees, Course Summary - 6/1/99
|
CSE Home
