ecoflex

2019年5月2日

[ROS] Chinese MOOC || Chapter-2.4 Metapackage

摘要：比如：最下面一行表示是metapackage 这些在根目录下面有所以定义一个navigation metapackage就是把不同的软件包组织起来阅读全文

posted @ 2019-05-02 05:23 ecoflex 阅读(207) 评论(0) 推荐(0)

[ROS] Chinese MOOC || Chapter-2.3 操作演示：Catkin工作空间探索

摘要： slides: https://www.gitbook.com/book/sychaichangkun/ros-tutorial-icourse163/details only on folder then apply catkin_make and we have much more files 阅读全文

posted @ 2019-05-02 05:18 ecoflex 阅读(158) 评论(0) 推荐(0)

[ROS] Chinese MOOC || Chapter-2.2 Package组成

摘要： packages are like the organs of a body. this stucture has no function... if you are not familar with the cmake written style, read the book “cmake实践”. 阅读全文

posted @ 2019-05-02 03:43 ecoflex 阅读(144) 评论(0) 推荐(0)

[ROS] Chinese MOOC || Chapter-2.1 Catkin工作空间与编译系统

摘要：建立工作空间：名字可以任意取，但里面必须有src文件夹编译：用source把编译完的workspace刷新到环境变量里，这样系统才知道ros可执行文件在哪，才能运行。否则roslaunch找不到工作空间。 package is the most basic element for catkin m 阅读全文

posted @ 2019-05-02 03:16 ecoflex 阅读(146) 评论(0) 推荐(0)

2019年4月14日

[Stanford Algorithms: Design and Analysis, Part 2] c30 The Bellman-Ford Algorithm

摘要：阅读全文

posted @ 2019-04-14 11:59 ecoflex 阅读(86) 评论(0) 推荐(0)

2019年4月6日

[Stanford Algorithms: Design and Analysis, Part 2] c29 Optimal Binary Search Trees

摘要：阅读全文

posted @ 2019-04-06 11:30 ecoflex 阅读(114) 评论(0) 推荐(0)

2019年4月5日

[Stanford Algorithms: Design and Analysis, Part 2] c28 Sequence Alignment Optimal Substructure

摘要：阅读全文

posted @ 2019-04-05 12:25 ecoflex 阅读(63) 评论(0) 推荐(0)

2019年4月2日

[Stanford Algorithms: Design and Analysis, Part 2] c27 The Knapsack Problem

摘要：阅读全文

posted @ 2019-04-02 10:19 ecoflex 阅读(121) 评论(0) 推荐(0)

2019年3月29日

[Stanford Algorithms: Design and Analysis, Part 2] c26 Intro to Dynamic Programming

摘要：阅读全文

posted @ 2019-03-29 09:16 ecoflex 阅读(157) 评论(0) 推荐(0)

2019年3月22日

[Stanford Algorithms: Design and Analysis, Part 2] c25 HUFFMAN CODES

摘要：阅读全文

posted @ 2019-03-22 12:43 ecoflex 阅读(117) 评论(0) 推荐(0)

[Stanford Algorithms: Design and Analysis, Part 2] c23 Clustering c24 Adv. Union-Find

摘要：第二题太难了，我参考了这个代码： https://github.com/dbarabanov/coursera/blob/master/algorithms_2/assignment_2/question_2.py (这个答案错了) https://github.com/sestus/algorit 阅读全文

posted @ 2019-03-22 03:42 ecoflex 阅读(155) 评论(0) 推荐(0)

2019年3月21日

[Stanford Algorithms: Design and Analysis, Part 2] c22- Kruskal's MST

摘要： // CPP program to demonstrate use of std::map #include <bits/stdc++.h> int main() { std::shared_ptr<char> pA(new char('A')); std::shared_ptr<char> pB( 阅读全文

posted @ 2019-03-21 10:47 ecoflex 阅读(146) 评论(0) 推荐(0)

2019年3月15日

[Stanford Algorithms: Design and Analysis, Part 2] c17-21 greedy algorithm | prim MST

摘要： Specific topics in Part 2 include: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes), dynamic programming (knapsack, s 阅读全文

posted @ 2019-03-15 06:31 ecoflex 阅读(461) 评论(0) 推荐(0)

2019年2月3日

Google ML Crash Course => Embeddings, Collaborative Filtering

摘要： https://developers.google.com/machine-learning/crash-course/embeddings/video-lecture? https://developers.google.com/machine-learning/crash-course/embe 阅读全文

posted @ 2019-02-03 14:40 ecoflex 阅读(223) 评论(0) 推荐(0)

2019年1月17日

2018 10-708 (CMU) Probabilistic Graphical Models {Lecture 25} [Spectral Methods]

摘要： draw a topic h and then draw independent xfrom multinomial distribution A paper can have several topics, and each topics has different proportions O i 阅读全文

posted @ 2019-01-17 12:59 ecoflex 阅读(164) 评论(0) 推荐(0)

2019年1月14日

2018 10-708 (CMU) Probabilistic Graphical Models {Lecture 23} [Applications in Computer Vision (cont’d) + Gaussian Process] (unfinished)

摘要： (unfinished) 阅读全文

posted @ 2019-01-14 09:44 ecoflex 阅读(114) 评论(0) 推荐(0)

2018 10-708 (CMU) Probabilistic Graphical Models {Lecture 22} [Applications in Computer Vision (cont’d) + Gaussian Process]

摘要： take log to Normal distribution, it's L2 loss, which might be the cause of the blurry results of VAE interpreting the meaning of latent vars is diffic 阅读全文

posted @ 2019-01-14 08:44 ecoflex 阅读(249) 评论(0) 推荐(0)

2018 10-708 (CMU) Probabilistic Graphical Models {Lecture 21} [A Hybrid: Deep Learning and Graphical Models]

摘要： conent in green box difficult to solve https://www.youtube.com/watch?v=btr1poCYIzw&t=60s 阅读全文

posted @ 2019-01-14 07:04 ecoflex 阅读(190) 评论(0) 推荐(0)

2019年1月12日

2018 10-708 (CMU) Probabilistic Graphical Models {Lecture 15} [Mean field Approximation]

摘要： p_bar(x) = p(x,e) p(x) is p(x|e) p_bar is hard to estimate, but p(x) is easy and p(x) \propotion p_bar q is easier for sampling, while we cant sample 阅读全文

posted @ 2019-01-12 13:13 ecoflex 阅读(307) 评论(0) 推荐(0)

2019年1月10日

2018 10-708 (CMU) Probabilistic Graphical Models {Lecture 14} [Loopy Belief Propagation] (unfinished)

摘要：阅读全文

posted @ 2019-01-10 12:49 ecoflex 阅读(316) 评论(0) 推荐(0)

公告