zhongziso种子搜
首页
功能
磁力转BT
BT转磁力
使用教程
免责声明
关于
zhongziso
搜索
Algorithms_ Design and Analysis, Part 2
magnet:?xt=urn:btih:c00efbad587f5ecb16ef2c7b4a61bbae223aa9b6&dn=Algorithms_ Design and Analysis, Part 2
磁力链接详情
Hash值:
c00efbad587f5ecb16ef2c7b4a61bbae223aa9b6
点击数:
81
文件大小:
1.52 GB
文件数量:
102
创建日期:
2017-8-19 23:40
最后访问:
2024-9-3 21:26
访问标签:
Algorithms_
Design
and
Analysis
Part
2
文件列表详情
9 - IX. HUFFMAN CODES (Week 2)/3 - Video (MP4) for A Greedy Algorithm (17 min).mp4 24.7 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/6 - Video (MP4) for Graph Search - Overview [Part I Review - Optional] (23 min).mp4 24.36 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/7 - Video (MP4) for The Ackermann Function [Advanced - Optional](17 min).mp4 22.64 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/1 - Video (MP4) for Stable Matching [Optional] (15 min).mp4 22.55 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/3 - Video (MP4) for Analysis of Union-by-Rank [Advanced - Optional](15).mp4 22.29 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/7 - Video (MP4) for Dijkstra's Shortest-Path Algorithm [Part I Review - Optional] (21 min).mp4 21.92 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/7 - Video (MP4) for Analysis of Papadimitriou's Algorithm (15 min).mp4 21.8 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/4 - Video (MP4) for Path Compression [Advanced - Optional] (15).mp4 21.51 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/6 - Video (MP4) for Random Walks on a Line (16 min).mp4 21.33 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/4 - Video (MP4) for The Traveling Salesman Problem (15 min).mp4 21 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/2 - Video (MP4) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).mp4 20.96 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/8 - Video (MP4) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].mp4 20.78 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/1 - Video (MP4) for Polynomial-Time Solvable Problems (14 min).mp4 20.49 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/2 - Video (MP4) for Why Study Algorithms_ [Part I Review - Optional] (19 min).mp4 20.25 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/2 - Video (MP4) for Reductions and Completeness (14 min).mp4 19.86 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/6 - Video (MP4) for Algorithmic Approaches to NP-Complete Problems (13 min).mp4 19.86 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/6 - Video (MP4) for Fast Implementation I (15 min).mp4 19.66 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/5 - Video (MP4) for The 2-SAT Problem (15 min).mp4 19.64 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/4 - Video (MP4) for A Reweighting Technique (14 min).mp4 19.62 MB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/1 - Video (MP4) for Optimal Substructure (14 min).mp4 19.54 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/9 - Video (MP4) for Heaps_ Operations and Applications [Part I Review - Optional] (18).mp4 19.49 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/9 - Video (MP4) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].mp4 19.09 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/3 - Video (MP4) for Correctness Proof I (16 min).mp4 19.02 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/3 - Video (MP4) for The Floyd-Warshall Algorithm (13 min).mp4 18.89 MB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/4 - Video (MP4) for Implementing Kruskal's Algorithm via Union-Find II (14 min).mp4 18.88 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/3 - Video (MP4) for Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).mp4 18.86 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/6 - Video (MP4) for Ananysis of Dynamic Programming Heuristic (15 min).mp4 18.78 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/1 - Video (MP4) for A Greedy Knapsack Heuristic (14 min).mp4 18.74 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/6 - Video (MP4) for A Space Optimization (12 min).mp4 18.34 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/1 - Video (MP4) for About the Course [Part I Review - Optional] (17 min).mp4 18.33 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/2 - Video (MP4) for Union-by-Rank [Advanced - Optional] (12 min).mp4 18.19 MB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/1 - Video (MP4) for Introduction to Greedy Algorithms (13 min).mp4 18.04 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/5 - Video (MP4) for A Dynamic Programming Algorithm for TSP (12 min).mp4 17.45 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/1 - Video (MP4) for Problem Definition (12 min).mp4 17.19 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/6 - Video (MP4) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].mp4 17.17 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/2 - Video (MP4) for A Greedy Algorithm (13 min).mp4 17.16 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/6 - Video (MP4) for Johnson's Algorithm II (11 min).mp4 16.86 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/3 - Video (MP4) for Linear Programming and Beyond [Optional] (11 min).mp4 16.84 MB
9 - IX. HUFFMAN CODES (Week 2)/5 - Video (MP4) for Correctness Proof II (13 min).mp4 16.75 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/7 - Video (MP4) for Internet Routing I [Optional] (11 min).mp4 16.72 MB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/2 - Video (MP4) for A Dynamic Programming Algorithm (12 min).mp4 16.71 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/2 - Video (MP4) for Optimal Substructure (12 min).mp4 16.53 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/3 - Video (MP4) for Definition and Interpretation of NP-Completeness I (11 min).mp4 16.35 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/5 - Video (MP4) for Johnson's Algorithm I (11 min).mp4 15.49 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/4 - Video (MP4) for A Dynamic Programming Heuristic for Knapsack (12 min).mp4 15.4 MB
9 - IX. HUFFMAN CODES (Week 2)/2 - Video (MP4) for Problem Definition (10 min).mp4 15.35 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/2 - Video (MP4) for Optimal Substructure (11 min).mp4 15.27 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/1 - Video (MP4) for Lazy Unions [Advanced - Optional] (10 min).mp4 15.24 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/1 - Video (MP4) for Single-Source Shortest Paths, Revisted (11 min).mp4 15.15 MB
7 - VII. CLUSTERING (Week 2)/1 - Video (MP4) for Application to Clustering (12 min).mp4 15.13 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/1 - Video (MP4) for MST Problem Definition (11 min).mp4 15 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/5 - Video (MP4) for Proof of Cut Property [Advanced - Optional] (12 min).mp4 14.99 MB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/2 - Video (MP4) for Application_ Optimal Caching (11 min).mp4 14.97 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/3 - Video (MP4) for WIS in Path Graphs_ A Linear-Time Algorithm (10 min).mp4 14.54 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/4 - Video (MP4) for Principles of Local Search II (10 min).mp4 14.49 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/5 - Video (MP4) for Graph Representations [Part I Review - Optional] (14 min).mp4 14.48 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/5 - Video (MP4) for The P vs. NP Question (9 min).mp4 14.28 MB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/5 - Video (MP4) for MSTs_ State-of-the-Art and Open Questions [Advanced - Optional] (9 min).mp4 14.23 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/2 - Video (MP4) for Smarter Search for Vertex Cover I (10 min).mp4 14.14 MB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/1 - Video (MP4) for The Knapsack Problem (10 min).mp4 14.08 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/4 - Video (MP4) for A Dynamic Programming Algorithm I (10 min).mp4 14.05 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/2 - Video (MP4) for Optimal Substructure (9 min).mp4 13.94 MB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/1 - Video (MP4) for Application_ Internet Routing (11 min).mp4 13.85 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/5 - Video (MP4) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].mp4 13.66 MB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/2 - Video (MP4) for A Dynamic Programming Algorithm (10 min).mp4 13.61 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/4 - Video (MP4) for The Basic Algorithm II (11 min).mp4 13.61 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/2 - Video (MP4) for WIS in Path Graphs_ Optimal Substructure (9 min).mp4 13.52 MB
9 - IX. HUFFMAN CODES (Week 2)/4 - Video (MP4) for Correctness Proof I (10 min).mp4 13.3 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/5 - Video (MP4) for Knapsack via Dynamic Programming, Revisited (10 min).mp4 13.22 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/7 - Video (MP4) for Fast Implementation II (10 min).mp4 13.17 MB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/3 - Video (MP4) for Implementing Kruskal's Algorithm via Union-Find I (9 min).mp4 12.9 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/2 - Video (MP4) for The Maximum Cut Problem II (9 min).mp4 12.84 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/5 - Video (MP4) for Detecting Negative Cycles (9 min).mp4 12.78 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/1 - Video (MP4) for The Vertex Cover Problem (9 min).mp4 12.75 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/1 - Video (MP4) for The Maximum Cut Problem I (9 min).mp4 12.41 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/3 - Video (MP4) for Analysis of a Greedy Knapsack Heuristic II (10 min).mp4 12.4 MB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/2 - Video (MP4) for Correctness of Kruskal's Algorithm (9 min).mp4 12.3 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/5 - Video (MP4) for Principles of Dynamic Programming (8 min).mp4 12.27 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/3 - Video (MP4) for Principles of Local Search I (9 min).mp4 12.22 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/4 - Video (MP4) for Definition and Interpretation of NP-Completeness II (8 min).mp4 12.18 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/3 - Video (MP4) for The Basic Algorithm I (9 min).mp4 12.11 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/5 - Video (MP4) for A Dynamic Programming Algorithm II (9 min).mp4 11.94 MB
7 - VII. CLUSTERING (Week 2)/2 - Video (MP4) for Correctness of Clustering Algorithm (10 min).mp4 11.93 MB
9 - IX. HUFFMAN CODES (Week 2)/1 - Video (MP4) for Introduction and Motivation (9 min).mp4 11.89 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/1 - Video (MP4) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).mp4 11.26 MB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/2 - Video (MP4) for Application_ Sequence Alignment (9 min).mp4 11.1 MB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/1 - Video (MP4) for Kruskal's MST Algorithm (8 min).mp4 11.02 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/8 - Video (MP4) for Internet Routing II [Optional] (7 min).mp4 10.68 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/3 - Video (MP4) for Smarter Search for Vertex Cover II (8 min).mp4 10.37 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/4 - Video (MP4) for Correctness Proof II (8 min).mp4 10.14 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/2 - Video (MP4) for Prim's MST Algorithm (8 min).mp4 9.99 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/3 - Video (MP4) for Proof of Optimal Substructure (7 min).mp4 9.86 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/5 - Video (MP4) for Handling Ties [Advanced - Optional] (7 min).mp4 9.65 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/4 - Video (MP4) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).mp4 9.62 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/1 - Video (MP4) for Problem Definition (7 min).mp4 9.48 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/3 - Video (MP4) for Correctness Proof - Part I (7 min).mp4 9.22 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/2 - Video (MP4) for Analysis of a Greedy Knapsack Heuristic I (7 min).mp4 8.93 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/1 - Video (MP4) for Problem Definition (6 min).mp4 7.79 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/4 - Video (MP4) for Correctness Proof - Part II (5 min).mp4 6.22 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/8 - Video (MP4) for Data Structures_ Overview [Part I Review - Optional] (5).mp4 4.89 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/4 - Video (MP4) for Big-Oh Notation [Part I Review - Optional] (4 min).mp4 4.36 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/4 - Video (MP4) for Epilogue (1 min).mp4 1.79 MB
其他位置