Advanced Algorithm
文章平均质量分 65
RizeJin
这个作者很懒,什么都没留下…
展开
-
NP-Problem
A problem is assigned to the NP (nondeterministic polynomial time) class if it is solvable in polynomial time by a nondeterministic Turing machine. A P-problem (whose solution time is bounded by a polynomial) is always also NP. If a problem is known to be转载 2010-08-04 12:31:00 · 819 阅读 · 0 评论 -
Polynomial Time
An algorithm is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is for some nonnegative integer , where is the complexity of the input. Polynomial-time algorithms are said to be "fast." M转载 2010-08-04 12:21:00 · 986 阅读 · 0 评论 -
Epigrams on Programming
from: http://www-pu.informatik.uni-tuebingen.de/users/klaeren/epigrams.htmlEpigrams on ProgrammingAlan J. PerlisYale University<br />This text has been published in SIGPLAN Notices Vol. 17, No. 9, September 1982, pages 7 - 13. I'm offering it here online u转载 2010-09-15 12:24:00 · 608 阅读 · 0 评论 -
Teach Yourself Programming in Ten Years
Teach Yourself Programming in Ten YearsPeter Norvig<br /> Why is everyone in such a rush?<br />Walk into any bookstore, and you'll see how to Teach Yourself Java in 7 Days alongside endless variations offering to teach Visual Basic, Windows, the Internet,转载 2010-09-15 12:27:00 · 799 阅读 · 0 评论 -
Divide and conquer algorithm
<br />In computer science, divide and conquer (D&C) is an important algorithm designparadigm based on multi-branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same (or relate原创 2010-09-08 11:55:00 · 671 阅读 · 0 评论 -
主项定理Master Method ——算法复习笔记
<br />在分析根据递归方程分析算法的时间复杂度时,常见到如下形式的方程,<br />T(n) = a * T(n/b) + f(n) <br />a ³ 1,b > 1,f(n)一般是个简单函数<br /><br />这时可以有2种方法,来计算时间复杂度。一是用递归树,逐层代入原式,最终形成一个级数,<br />然后用一个函数来表达,得到T(n)。<br /><br />二是应用主项定理Master Method 。其实,主项定理也就是对递归树方法的一种归纳,形成了<br />固定的计算方式,并分三种情转载 2010-09-30 16:55:00 · 13660 阅读 · 2 评论 -
Amdahl’s law (阿姆达尔定律)的演化和思考
from: http://manio.org/progress-and-thoughts-of-amdahls-law-286.htmlG.M.Amdahl在1967年提出了Amdahl’s law,针对并行处理的scalability给出了一个模型,指出使用并行处理的提速由问题的可并行的部分所决定。这个模型为并行计算系统的设计者提供了指导。其形式如下:f为问题中可被并行处理的部分的比例,m为并行处理机的数量,Speedup为并行后相比串行时的提速。Amdahl’s law表明在问题的可并行部分不大时,增加转载 2010-10-03 00:01:00 · 2302 阅读 · 0 评论 -
super-resolution
<br />http://www.cvchina.info/tag/super-resolution/转载 2010-11-15 13:29:00 · 743 阅读 · 0 评论 -
什么是alpha matting?
<br /> 同学给我一篇文献,针对视频对象分割,论文提出了一种精确运动层分割和Matting技术,将运动分割与alpha matting技术结合起来,由于对alpha matting不太懂,所以找资料认真学习了一下,整理收集如下:<br />什么是alpha matting?<br /> Pulling a matte: matte在字典里的解释是不平滑的意思,matting在photoshop里面是指消除图像的背景边缘或者去掉粗糙点。把digital matting技术应用于图像,是基于这样一转载 2010-11-15 15:39:00 · 5001 阅读 · 0 评论