种子简介

种子名称： Algo2-Stanford
文件类型：
文件数目： 118个文件
文件大小： 1.71 GB
收录时间： 2014-5-16 23:06
已经下载： 3次
资源热度： 65
最近下载： 2024-12-11 20:56

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:5E08CB06A704C7CFB06D4B566416FB512340C78C&dn=Algo2-Stanford 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

Algo2-Stanford.torrent

1 - 1 - Application- Internet Routing (11 min).mp413.85MB

1 - 2 - Application- Sequence Alignment (9 min).mp411.1MB

10 - 1 - Introduction- Weighted Independent Sets in Path Graphs (8 min).mp411.26MB

10 - 2 - WIS in Path Graphs- Optimal Substructure (9 min).mp413.52MB

10 - 3 - WIS in Path Graphs- A Linear-Time Algorithm (10 min).mp414.54MB

10 - 4 - WIS in Path Graphs- A Reconstruction Algorithm (7 min).mp49.62MB

10 - 5 - Principles of Dynamic Programming (8 min).mp412.27MB

11 - 1 - The Knapsack Problem (10 min).mp414.08MB

11 - 2 - A Dynamic Programming Algorithm (10 min).mp413.61MB

11 - 3 - Example [Review - Optional] (14 min).mp424.21MB

12 - 1 - Optimal Substructure (14 min).mp419.54MB

12 - 2 - A Dynamic Programming Algorithm (12 min).mp416.71MB

13 - 1 - Problem Definition (12 min).mp417.19MB

13 - 2 - Optimal Substructure (9 min).mp413.94MB

13 - 3 - Proof of Optimal Substructure (7 min) (1).mp49.86MB

13 - 3 - Proof of Optimal Substructure (7 min).mp49.86MB

13 - 4 - A Dynamic Programming Algorithm I (10 min) (1).mp414.05MB

13 - 4 - A Dynamic Programming Algorithm I (10 min).mp414.05MB

13 - 5 - A Dynamic Programming Algorithm II (9 min) (1).mp411.94MB

13 - 5 - A Dynamic Programming Algorithm II (9 min).mp411.94MB

14 - 1 - Single-Source Shortest Paths, Revisted (11 min) (1).mp415.15MB

14 - 1 - Single-Source Shortest Paths, Revisted (11 min).mp415.15MB

14 - 2 - Optimal Substructure (11 min) (1).mp415.27MB

14 - 2 - Optimal Substructure (11 min).mp415.27MB

14 - 3 - The Basic Algorithm I (9 min) (1).mp412.11MB

14 - 3 - The Basic Algorithm I (9 min).mp412.11MB

14 - 4 - The Basic Algorithm II (11 min) (1).mp413.61MB

14 - 4 - The Basic Algorithm II (11 min).mp413.61MB

14 - 5 - Detecting Negative Cycles (9 min) (1).mp412.78MB

14 - 5 - Detecting Negative Cycles (9 min).mp412.78MB

14 - 6 - A Space Optimization (12 min) (1).mp418.34MB

14 - 6 - A Space Optimization (12 min).mp418.34MB

14 - 7 - Internet Routing I [Optional] (11 min) (1).mp416.72MB

14 - 7 - Internet Routing I [Optional] (11 min).mp416.72MB

14 - 8 - Internet Routing II [Optional] (7 min) (1).mp410.68MB

14 - 8 - Internet Routing II [Optional] (7 min).mp410.68MB

15 - 1 - Problem Definition (7 min) (1).mp49.48MB

15 - 1 - Problem Definition (7 min) (2).mp49.48MB

15 - 1 - Problem Definition (7 min).mp49.48MB

15 - 2 - Optimal Substructure (12 min) (1).mp416.53MB

15 - 2 - Optimal Substructure (12 min).mp416.53MB

15 - 3 - The Floyd-Warshall Algorithm (13 min).mp418.89MB

15 - 4 - A Reweighting Technique (14 min).mp419.62MB

15 - 5 - Johnson-'s Algorithm I (11 min).mp415.49MB

15 - 6 - Johnson-'s Algorithm II (11 min).mp416.86MB

16 - 1 - Polynomial-Time Solvable Problems (14 min).mp420.49MB

16 - 2 - Reductions and Completeness (14 min).mp419.86MB

16 - 3 - Definition and Interpretation of NP-Completeness I (11 min).mp416.35MB

16 - 4 - Definition and Interpretation of NP-Completeness II (8 min).mp412.18MB

16 - 5 - The P vs. NP Question (9 min).mp414.28MB

16 - 6 - Algorithmic Approaches to NP-Complete Problems (13 min).mp419.86MB

17 - 1 - The Vertex Cover Problem (9 min).mp412.75MB

17 - 2 - Smarter Search for Vertex Cover I (10 min).mp414.14MB

17 - 3 - Smarter Search for Vertex Cover II (8 min).mp410.37MB

17 - 4 - The Traveling Salesman Problem (15 min).mp421MB

17 - 5 - A Dynamic Programming Algorithm for TSP (12 min).mp417.45MB

18 - 1 - A Greedy Knapsack Heuristic (14 min).mp418.74MB

18 - 2 - Analysis of a Greedy Knapsack Heuristic I (7 min).mp48.93MB

18 - 3 - Analysis of a Greedy Knapsack Heuristic II (10 min).mp412.4MB

18 - 4 - A Dynamic Programming Heuristic for Knapsack (12 min).mp415.41MB

18 - 5 - Knapsack via Dynamic Programming, Revisited (10 min).mp413.22MB

18 - 6 - Ananysis of Dynamic Programming Heuristic (15 min).mp418.7MB

19 - 1 - The Maximum Cut Problem I (9 min).mp412.41MB

19 - 2 - The Maximum Cut Problem II (9 min).mp412.84MB

19 - 3 - Principles of Local Search I (9 min).mp412.22MB

19 - 4 - Principles of Local Search II (10 min).mp414.49MB

19 - 5 - The 2-SAT Problem (15 min).mp419.64MB

19 - 6 - Random Walks on a Line (16 min).mp421.33MB

19 - 7 - Analysis of Papadimitriou-'s Algorithm (15 min).mp421.62MB

2 - 1 - About the Course [Part I Review - Optional] (17 min).mp418.33MB

2 - 2 - Why Study Algorithms- [Part I Review - Optional] (19 min).mp420.25MB

2 - 3 - Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).mp418.86MB

2 - 4 - Big-Oh Notation [Part I Review - Optional] (4 min).mp44.36MB

2 - 5 - Graph Representations [Part I Review - Optional] (14 min).mp414.48MB

2 - 6 - Graph Search - Overview [Part I Review - Optional] (23 min).mp424.36MB

2 - 7 - Dijkstra-'s Shortest-Path Algorithm [Part I Review - Optional] (21 min).mp421.92MB

2 - 8 - Data Structures- Overview [Part I Review - Optional] (5 min).mp44.89MB

2 - 9 - Heaps- Operations and Applications [Part I Review - Optional] (18 min).mp419.49MB

20 - 1 - Stable Matching [Optional] (15 min).mp422.55MB

20 - 2 - Matchings, Flows, and Braess-'s Paradox [Optional] (14 min).mp420.96MB

20 - 3 - Linear Programming and Beyond [Optional] (11 min).mp416.84MB

20 - 4 - Epilogue (1 min).mp41.79MB

3 - 1 - Introduction to Greedy Algorithms (13 min).mp418.04MB

3 - 2 - Application- Optimal Caching (11 min).mp414.97MB

4 - 1 - Problem Definition (6 min).mp47.79MB

4 - 2 - A Greedy Algorithm (13 min).mp417.16MB

4 - 3 - Correctness Proof - Part I (7 min).mp49.22MB

4 - 4 - Correctness Proof - Part II (5 min).mp46.22MB

4 - 5 - Handling Ties [Advanced - Optional] (7 min).mp49.65MB

5 - 1 - MST Problem Definition (11 min).mp415MB

5 - 2 - Prim-'s MST Algorithm (8 min).mp49.99MB

5 - 3 - Correctness Proof I (16 min).mp419.02MB

5 - 4 - Correctness Proof II (8 min).mp410.14MB

5 - 5 - Proof of Cut Property [Advanced - Optional] (12 min).mp460.81KB

5 - 6 - Fast Implementation I (15 min).mp419.66MB

5 - 7 - Fast Implementation II (10 min).mp413.17MB

6 - 1 - Kruskal-'s MST Algorithm (8 min).mp411.02MB

6 - 2 - Correctness of Kruskal-'s Algorithm (9 min).mp412.3MB

6 - 3 - Implementing Kruskal-'s Algorithm via Union-Find I (9 min).mp412.9MB

6 - 4 - Implementing Kruskal-'s Algorithm via Union-Find II (14 min).mp418.88MB

6 - 5 - MSTs- State-of-the-Art and Open Questions [Advanced - Optional] (9 min).mp414.23MB

7 - 1 - Application to Clustering (12 min).mp415.13MB

7 - 2 - Correctness of Clustering Algorithm (10 min).mp411.93MB

8 - 1 - Lazy Unions [Advanced - Optional] (10 min).mp415.24MB

8 - 2 - Union-by-Rank [Advanced - Optional] (12 min).mp418.19MB

8 - 3 - Analysis of Union-by-Rank [Advanced - Optional] (15 min).mp422.29MB

8 - 4 - Path Compression [Advanced - Optional] (15 min).mp421.51MB

8 - 5 - Path Compression- The Hopcroft-Ullman Analysis I [Advanced - Optional] (9 min).mp413.66MB

8 - 6 - Path Compression- The Hopcroft-Ullman Analysis II [Advanced - Optional] (12 min).mp417.17MB

8 - 7 - The Ackermann Function [Advanced - Optional] (17 min).mp422.64MB

8 - 8 - Path Compression- Tarjan-'s Analysis I [Advanced - Optional] (14 min).mp420.78MB

8 - 9 - Path Compression- Tarjan-'s Analysis II [Advanced - Optional] (14 min).mp419.09MB

9 - 1 - Introduction and Motivation (9 min).mp411.89MB

9 - 2 - Problem Definition (10 min).mp415.35MB

9 - 3 - A Greedy Algorithm (17 min).mp424.7MB

9 - 4 - A More Complex Example (4 min).mp45.51MB

9 - 5 - Correctness Proof I (10 min).mp413.3MB

9 - 6 - Correctness Proof II (13 min).mp416.75MB