17. Floyd Warshall Algorithm - All-Pairs Shortest Path
21:51
17. Floyd Warshall Algorithm - All-Pairs Shortest Path
16.2 Bellman Ford Algorithm - Shortest Path Problem (2/2)
5:58
16.2 Bellman Ford Algorithm - Shortest Path Problem (2/2)
16.1 Bellman Ford Algorithm - Shortest Path Problem (1/2)
14:08
16.1 Bellman Ford Algorithm - Shortest Path Problem (1/2)
15.3 Dijkstra's Algorithm - Shortest Path Problem (3/3)
4:05
15.3 Dijkstra's Algorithm - Shortest Path Problem (3/3)
15.2 Dijkstra's Algorithm - Shortest Path Problem (2/3)
14:57
15.2 Dijkstra's Algorithm - Shortest Path Problem (2/3)
15.1 Dijkstra's Algorithm - Shortest Path Problem (1/3)
14:56
15.1 Dijkstra's Algorithm - Shortest Path Problem (1/3)
14 Shortest Path Algorithm - How to Relax an Edge - Properties of Relaxation
15:02
14 Shortest Path Algorithm - How to Relax an Edge - Properties of Relaxation
14.1 Shortest Path Algorithm (1/2)
15:01
14.1 Shortest Path Algorithm (1/2)
13.3 Kruskal's Algorithm To Compute Minimum Spanning Tree (3/3)
4:07
13.3 Kruskal's Algorithm To Compute Minimum Spanning Tree (3/3)
13.2 Kruskal's Algorithm To Compute Minimum Spanning Tree (2/3)
14:24
13.2 Kruskal's Algorithm To Compute Minimum Spanning Tree (2/3)
13.1 Kruskal's Algorithm To Compute Minimum Spanning Tree (1/3)
14:20
13.1 Kruskal's Algorithm To Compute Minimum Spanning Tree (1/3)
12.4 Proof of Correctness of Prim's Algorithm (4/4)
14:49
12.4 Proof of Correctness of Prim's Algorithm (4/4)
12.3 Prim's Algorithm To Compute Minimum Spanning Tree (3/4)
7:31
12.3 Prim's Algorithm To Compute Minimum Spanning Tree (3/4)
12.2 Prim's Algorithm To Compute Minimum Spanning Tree (2/4)
12:14
12.2 Prim's Algorithm To Compute Minimum Spanning Tree (2/4)
12.1 Prim's Algorithm To Compute Minimum Spanning Tree (1/4)
14:57
12.1 Prim's Algorithm To Compute Minimum Spanning Tree (1/4)
4.4 Spell Correction: Real Word Errors - Information Retrieval, Natural Language Processing (4/4)
10:54
4.4 Spell Correction: Real Word Errors - Information Retrieval, Natural Language Processing (4/4)
4.3 Spell Correction: Candidate Generation, Unigram and Bigram Probabilities - IR, NLP (3/4)
13:52
4.3 Spell Correction: Candidate Generation, Unigram and Bigram Probabilities - IR, NLP (3/4)
4.2 How to do Spelling Correction? Noisy Channel Model, Information Retrieval, NLP (2/4)
6:59
4.2 How to do Spelling Correction? Noisy Channel Model, Information Retrieval, NLP (2/4)
4.1 How to do Spelling Correction? Information Retrieval, Natural Language Processing (1/4)
7:35
4.1 How to do Spelling Correction? Information Retrieval, Natural Language Processing (1/4)
11.3 Proof of Correctness of Greedy Algorithm of Huffman Coding (3/3)
11:19
11.3 Proof of Correctness of Greedy Algorithm of Huffman Coding (3/3)
11.2 Proof of Correctness of Greedy Algorithm of Huffman Coding (2/3)
10:46
11.2 Proof of Correctness of Greedy Algorithm of Huffman Coding (2/3)
11.1 Proof of Correctness of Greedy Algorithm of Huffman Coding (1/3)
14:19
11.1 Proof of Correctness of Greedy Algorithm of Huffman Coding (1/3)
3.4 Web Question Answering, Using Knowledge in Q/A (4/4)
7:15
3.4 Web Question Answering, Using Knowledge in Q/A (4/4)
10.2 Huffman Coding, Greedy Algorithm (2/2)
14:35
10.2 Huffman Coding, Greedy Algorithm (2/2)
3.3 Web Question Answering, IR-based Factoid Q/A cont. (3/4)
12:12
3.3 Web Question Answering, IR-based Factoid Q/A cont. (3/4)
10.1 Huffman Coding, Greedy Algorithm (1/2)
14:50
10.1 Huffman Coding, Greedy Algorithm (1/2)
3.2 Web Question Answering, IR-based Factoid Q/A (2/4)
11:23
3.2 Web Question Answering, IR-based Factoid Q/A (2/4)
9.2 Proof of Correctness of Greedy Algorithm of Fractional Knapsack Problem (2/2)
11:27
9.2 Proof of Correctness of Greedy Algorithm of Fractional Knapsack Problem (2/2)
9.1 Fractional Knapsack Problem, Greedy Algorithm (1/2)
13:57
9.1 Fractional Knapsack Problem, Greedy Algorithm (1/2)
3.1 Web Question Answering (1/4)
9:05
3.1 Web Question Answering (1/4)