Given two sequences of letters A and B, find if B is a subsequence of A in thesense that one can delete some letters from A and obtain the sequence B. Greedy领先的思想.(always stay ahead) There is a line of 111 stalls, some of which need to be covered wit…

Relevant Readable Links Name Interesting topic Comment Edwin Chen 非参贝叶斯   徐亦达老板 Dirichlet Process 学习目标:Dirichlet Process, HDP, HDP-HMM, IBP, CRM Alex Kendall Geometry and Uncertainty in Deep Learning for Computer Vision 语义分割 colah's blog Feature Visu…

Ref: [IR] Compression Ref: [IR] Link Analysis Planar Graph From: http://www.csie.ntnu.edu.tw/~u91029/PlanarGraph.html#1 由於缺乏優美規律,因此談論對偶圖時,習慣忽略同構. 最特別的對偶圖例子,就是橋( bridge )與自環( loop ). 舉例來說,原圖是一棵樹,對偶圖是一個點以及一大堆自環:各種樹對應各種自環包覆方式. Spanning Tree From: http:/…

把博客的算法过一遍,我的天呐多得很,爱咋咋地! 未来可考虑下博弈算法. 基本的编程陷阱:[c++] 面试题之犄角旮旯 第壹章[有必要添加Python] 基本的算法思想:[Algorithm] 面试题之犄角旮旯 第贰章[基础算法思想] 基本的练手习题:[LeetCode] 面试题之犄角旮旯 第叁章[综合性算法问题] 彩色PDF的讲义:CMU: Parallel and Sequential Data Structures and Algorithms 一.数据结构 Outline 容器(Conta…

图的概念有点多,在此只讨论最基础的内容,所以选择比较薄的高教版<数据结构>. 1.4 非线性数据结构--图 ........................................................................................................... 101 1.4.1 图的基本概念.......................................................................…

作者:supernova 出处:http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=greedyAlg John Smith is in trouble! He is a TopCoder member and once he learned to master the "Force" of dynamic programming, he began solving problem after p…

@http://www-cs-faculty.stanford.edu/people/karpathy/cvpr2015papers/ CVPR 2015 papers (in nicer format than this) maintained by @karpathy NEW: This year I also embedded the (1,2-gram) tfidf vectors of all papers with t-sne and placed them in an interf…

2009-03-26 18:31:31 原文链接 1.前言 ICE-E是ICE在嵌入式上运行的一个版本,与ICE比较如下: Category Ice 3.3.0 Ice-E 1.3.0 Thread Pool concurrency model Bidirectional connections Active connection management (ACM) Request batching Support for UDP and SSL Objects by Value Implicit…

Given two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length k <= m + n from digits of the two. The relative order of the digits from the same array must be preserved. Return an array of the k digit…

More important than algorithms(just problems #$!%), the techniques/concepts residing at the base of such algorithms is more important. There are broadly 4 ways in which classification of algorithms can be done. Classification by purpose Each algorith…