2025 cs433 4/9/25 Bsplines and other splines: Hermite Bezier and Chuthul-Rom
1:32:45
2025 cs433 4/9/25 Bsplines and other splines: Hermite Bezier and Chuthul-Rom
2025 cs433 4/7/25 Accelerating DS
1:15:27
2025 cs433 4/7/25 Accelerating DS
2025 cs433 4/23/25 tone representation and correction
1:31:52
2025 cs433 4/23/25 tone representation and correction
2025 cs433 4/9/25 Why Spline, types of continuity and why should we care
1:36:36
2025 cs433 4/9/25 Why Spline, types of continuity and why should we care
2025 cs433 4/14/25 curves and surfaces
1:18:07
2025 cs433 4/14/25 curves and surfaces
cs433 2025 4/30/25 Convolutions and HDR
1:27:36
cs433 2025 4/30/25 Convolutions and HDR
2025 cs433 4/23/28 convolutions
1:19:55
2025 cs433 4/23/28 convolutions
2025 cs433 4/28/25 soothing, boundaries and bilateral Gaussian smoothing
1:18:49
2025 cs433 4/28/25 soothing, boundaries and bilateral Gaussian smoothing
2025 cs433 4/21/25. More modeling of shapes: CSG and iso-surfaces
1:17:01
2025 cs433 4/21/25. More modeling of shapes: CSG and iso-surfaces
BRDF and Ambient occlusion
1:12:18
BRDF and Ambient occlusion
Highlight: 2022 Lecture 6. More SkipList and class discussion
1:32:12
Highlight: 2022 Lecture 6. More SkipList and class discussion
cs445 Lecture 14 (only on D2L)
0:13
cs445 Lecture 14 (only on D2L)
2022 Lecture 4. Optimality and Pesimality of TMA. Things you did not know about MesgeSort and genera
1:37:48
2022 Lecture 4. Optimality and Pesimality of TMA. Things you did not know about MesgeSort and genera
2022. Lecture 3. Stable Marriage Algorithm
1:28:50
2022. Lecture 3. Stable Marriage Algorithm
2022. Lecture 9. Hashing 2 - dot product, and universal families
1:30:26
2022. Lecture 9. Hashing 2 - dot product, and universal families
2022 Lecture 6. More SkipList and class discussion (H)
1:32:42
2022 Lecture 6. More SkipList and class discussion (H)
Highlight: 2022 Lecture 6. More SkipList and class discussion
1:31:42
Highlight: 2022 Lecture 6. More SkipList and class discussion
2022 lecture 1. Intro
1:18:34
2022 lecture 1. Intro
Highlight: 2022 Lecture 6. More SkipList and class discussion
1:32:12
Highlight: 2022 Lecture 6. More SkipList and class discussion
2022. Lecture 11. Graphs. Topological Order. Kuhn Algorithm
2:02:32
2022. Lecture 11. Graphs. Topological Order. Kuhn Algorithm
2022. Lecture 11. How Graphs are stored. Topological Order. Kuhn Algorithm
2:02:32
2022. Lecture 11. How Graphs are stored. Topological Order. Kuhn Algorithm
2022 lecture 1. Intro
1:18:34
2022 lecture 1. Intro
2022 Lecture 5. SkipLists part 1
1:34:12
2022 Lecture 5. SkipLists part 1
cs455: Lecture 14. Linear Programming
1:18:51
cs455: Lecture 14. Linear Programming
2022 Lecture 2. More Obvious and less obvious examples of running time analysis
1:32:22
2022 Lecture 2. More Obvious and less obvious examples of running time analysis
2022. Lecture 13. Wrapping shortest paths. Canonizations in hashing. Dynamic Programming - intro
1:45:20
2022. Lecture 13. Wrapping shortest paths. Canonizations in hashing. Dynamic Programming - intro
cs445. Lecture 13 Part i. Clustering runs of points
53:19
cs445. Lecture 13 Part i. Clustering runs of points
cs445 Lecture 3. Stable Marriage and Skip List 1
1:18:52
cs445 Lecture 3. Stable Marriage and Skip List 1
cs445 Lecture 9. Class Discussion about hw1 and LCS
1:16:30
cs445 Lecture 9. Class Discussion about hw1 and LCS
cs445 Lecture 5. Hashing 1
1:17:11
cs445 Lecture 5. Hashing 1