Yang Xu - VideoAndMovie

dextran v02c detect clumps

0:11

dextran v02c detect clumps

dextran v02b hough circles

0:11

dextran v02b hough circles

dextran v01c edged

0:11

dextran v01c edged

dextran v02d detect clumps

0:11

dextran v02d detect clumps

dextran v02e detect clumps

0:11

dextran v02e detect clumps

CS549 - Evaluation of models

1:14:36

CS549 - Evaluation of models

CS460 - Divide and conquer: maximum subarray problem

59:01

CS460 - Divide and conquer: maximum subarray problem

CS549 - Logistic regression model

1:01:08

CS549 - Logistic regression model

CS460 - Growth of functions: Asymptotic notations

1:11:00

CS460 - Growth of functions: Asymptotic notations

CS549 - Linear regression solved with gradient descent

41:06

CS549 - Linear regression solved with gradient descent

CS460 - Getting started: Merge sort

1:15:56

CS460 - Getting started: Merge sort

CS549 - Linear regression and normal equation solution

1:14:55

CS549 - Linear regression and normal equation solution

CS460 - Getting started: Insertion sort

1:18:04

CS460 - Getting started: Insertion sort

CS549 - Python, Jupyter, and numpy

1:14:38

CS549 - Python, Jupyter, and numpy

CS549 - Introduction

1:17:20

CS549 - Introduction

CS460 - Introduction

1:17:29

CS460 - Introduction

Principal Component Analysis

1:03:33

Principal Component Analysis

Clustering algorithms: Hierarchical clustering and DBSCAN

31:05

Clustering algorithms: Hierarchical clustering and DBSCAN

A brief introduction to GANs

30:34

A brief introduction to GANs

A brief lecture about NP-completeness

46:09

A brief lecture about NP-completeness

Review for final exam

5:09

Review for final exam

Single source shortest paths problem for dag (directional, acyclic graph).

18:31

Single source shortest paths problem for dag (directional, acyclic graph).

Clustering algorithms: K-means and mixture of Gaussians

1:13:35

Clustering algorithms: K-means and mixture of Gaussians

Single source shortest paths problem: Bellman-Ford algorithm and Dijkstra's algorithm

1:17:48

Single source shortest paths problem: Bellman-Ford algorithm and Dijkstra's algorithm

Principal component analysis (PCA) (part 2)

43:46

Principal component analysis (PCA) (part 2)

Principal component analysis (PCA) (part 1)

30:57

Principal component analysis (PCA) (part 1)

Minimum spanning trees (part 2): Prim's algorithm

49:42

Minimum spanning trees (part 2): Prim's algorithm

Shortest paths problem: Problem background

15:05

Shortest paths problem: Problem background

Deep contextualized representations (part 2): Transformer, GPT, and BERT

1:01:02

Deep contextualized representations (part 2): Transformer, GPT, and BERT

Minimum spanning trees: Generic method and Kruskal Algorithm

1:11:45

Minimum spanning trees: Generic method and Kruskal Algorithm