sinc - VideoAndMovie

1.9 DIF FFT Algorithm

8:41

1.9 DIF FFT Algorithm

1.7 Overlap Add Method

9:37

1.7 Overlap Add Method

1.4 Circular convolution | Concentric Circle method

12:18

1.4 Circular convolution | Concentric Circle method

1.5 Matrix Multiplication Method

7:25

1.5 Matrix Multiplication Method

P, NP, NP-Hard, NP-Complete problems

9:28

P, NP, NP-Hard, NP-Complete problems

Recursion Tree

13:19

Recursion Tree

Recurrence

21:29

Recurrence

Asymptotic Notation - Examples

13:30

Asymptotic Notation - Examples

Asymptotic Notations

20:02

Asymptotic Notations

Algorithm Analysis

15:41

Algorithm Analysis

Branch and Bound Algorithms

19:58

Branch and Bound Algorithms

Backtracking

21:14

Backtracking

Dynamic Programming

40:28

Dynamic Programming

Divide and Conquer Algorithms

16:57

Divide and Conquer Algorithms

Randomized Algorithm

11:06

Randomized Algorithm

Greedy Algorithms

6:03

Greedy Algorithms

Kruskal's algorithm

5:21

Kruskal's algorithm

Minimum Spanning Tree | Prim's algorithm

18:47

Minimum Spanning Tree | Prim's algorithm

Polygonal approximation of digital boundary

12:53

Polygonal approximation of digital boundary

Dijkstra's shortest path algorithm

33:36

Dijkstra's shortest path algorithm

Biconnectivity

23:21

Biconnectivity

Simple regional descriptors

4:14

Simple regional descriptors

Fourier Descriptors

8:07

Fourier Descriptors

Simple Boundary Descriptors | Digital Image Processing

8:02

Simple Boundary Descriptors | Digital Image Processing

Euler Circuit

11:25

Euler Circuit

Chain Code | Digital Image Processing

17:18

Chain Code | Digital Image Processing

Introduction to Representation and Description | Digital Image Processing

3:38

Introduction to Representation and Description | Digital Image Processing

Edge Detection

17:08

Edge Detection

Introduction to Edge Detection

8:49

Introduction to Edge Detection

Grayscale Morphology

12:12

Grayscale Morphology