Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
P
project2
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
20200203098
project2
Commits
698980f9
Commit
698980f9
authored
5 years ago
by
Wenzhe
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Update README.md
parent
66e72bbe
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
0 additions
and
1 deletions
+0
-1
README.md
+0
-1
No files found.
README.md
View file @
698980f9
...
...
@@ -4,7 +4,6 @@
| 日期 | 主题 | 知识点详情 | 课件 | 相关阅读 | 其 他 | 作业 |
|---------|---------|---------|---------|---------|---------|---------|
| PART 0 前期基础复习(机器学习与凸优化)|
| TBD | (直播-Lecture)算法复杂度,动态规划,DTW | 时间/空间复杂度的分析、Master's Theorem(主定理), 递归程序的时间复杂度与空间复杂度、动态规划算法介绍、编辑距离的计算、DTW的技术与应用,Hamming Distance以及Semantic Hashing | |
[
[博客
]
十分钟搞定时间复杂度](https://www.jianshu.com/p/f4cca5ce055a)
<br/>
[
[博客
]
Dynamic Programming – Edit Distance Problem](https://algorithms.tutorialhorizon.com/dynamic-programming-edit-distance-problem/)
<br/>
[
[材料
]
Master's Theorem](http://people.csail.mit.edu/thies/6.046-web/master.pdf)
<br/>
[
Introduction to Algorithm (MIT Press)
](
http://ressources.unisciel.fr/algoprog/s00aaroot/aa00module1/res/%5BCormen-AL2011%5DIntroduction_To_Algorithms-A3.pdf
)
<br/>
|||
| TBD | (直播-Discussion) 经典数据结构与算法 |Divide and Conquer技术以及应用|||||
| TBD | (直播-Discussion) 经典数据结构与算法 |哈希表,搜索树,堆(优先堆)|||||
...
...
This diff is collapsed.
Click to expand it.
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment