随笔分类 -  algorithm

摘要:w数组的元素排序,不同编程语言的算法。 w耗时、耗内存。 情景: 一张grab表,行时时新增中;每次按一定条件取出一定行,遍历每行,对单表单行数据进行处理分析,分析后再更新是否分析二元值标识字段。 若采用外部脚本分析,如php,暂时不考虑存储过程,同时认为只有一个分析脚本在运行,无并发分析,则需要获 阅读全文
posted @ 2017-02-16 13:11 papering 阅读(741) 评论(0) 推荐(0)
摘要:w取和集,避免循环中循环,先将行冗余,再删除行,即做加减运算而不是乘法运算。 w问题:怎么在声量声明中引入变量?即实现下中将wa,wb,we不作为参数传入? id wint wchar wa 1 101 101wa2 102 102wa3 103 103wa4 104 104wa5 105 105w 阅读全文
posted @ 2017-01-19 16:26 papering 阅读(247) 评论(0) 推荐(0)
摘要:小结: 1、卷积广泛存在与物理设备、计算机程序的smoothing平滑、sharpening锐化过程; 空间卷积可应用在图像处理中:函数f(原图像)经过滤器函数g形成新函数f-g(平滑化或锐利化的新图像)。 卷积可应用在物理设备、计算程序,对数据进行平滑化或锐利化。 空间卷积也应用于图像处理中的边缘 阅读全文
posted @ 2017-01-13 14:27 papering 阅读(499) 评论(0) 推荐(0)
摘要:https://www.sccs.swarthmore.edu/users/02/jill/graphics/hw3/hw3.html http://web.cs.ucdavis.edu/~ma/ECS175_S00/Notes/0411_b.pdf 阅读全文
posted @ 2017-01-12 13:55 papering 阅读(262) 评论(0) 推荐(0)
摘要:http://openinx.github.io/2013/01/01/plane-sweep-thinking/ 平面直角坐标系中有N个点,给出N个点的坐标,请设计一个高效算法计算最近点对距离。 阅读全文
posted @ 2017-01-12 13:46 papering 阅读(200) 评论(0) 推荐(0)
摘要:Monte Carlo methods https://zh.wikipedia.org/wiki/蒙地卡羅方法 通常蒙地卡羅方法可以粗略地分成两类:一类是所求解的问题本身具有内在的随机性,借助计算机的运算能力可以直接模拟这种随机的过程。例如在核物理研究中,分析中子在反应堆中的传输过程。中子与原子核 阅读全文
posted @ 2017-01-11 22:13 papering 阅读(189) 评论(0) 推荐(0)
摘要:https://page.mi.fu-berlin.de/rojas/neural/chapter/K7.pdf 7.1 Learning as gradient descent We saw in the last chapter that multilayered networks are ca 阅读全文
posted @ 2017-01-10 15:13 papering 阅读(206) 评论(0) 推荐(0)
摘要:总结: 1、 一个算法由控制结构(顺序、分支和循环3种)和原操作(指固有数据类型的操作)构成的,则算法时间取决于两者的综合效果。 2、 N*N矩阵乘法算法 时间复杂度T(n)=O(n^3) for(i=1;i<=n;i++) for(j=1;j<=n;j++) c[i][j]=0 for(k=1;k 阅读全文
posted @ 2016-12-29 19:54 papering 阅读(388) 评论(0) 推荐(0)
摘要:http://www-igm.univ-mlv.fr/~lecroq/string/node14.html Main features performs the comparisons from right to left; preprocessing phase in O(m+) time and 阅读全文
posted @ 2016-12-29 17:13 papering 阅读(381) 评论(0) 推荐(0)
摘要:COMPUTER ORGANIZATION AND ARCHITECTURE DESIGNING FOR PERFORMANCE NINTH EDITION 阅读全文
posted @ 2016-12-28 13:19 papering 阅读(220) 评论(0) 推荐(0)
摘要:COMPUTER ORGANIZATION AND ARCHITECTURE DESIGNING FOR PERFORMANCE NINTH EDITION Like sign magnitude, twos complement representation uses the most signi 阅读全文
posted @ 2016-12-27 23:24 papering 阅读(265) 评论(0) 推荐(0)
摘要:COMPUTER ORGANIZATION AND ARCHITECTURE DESIGNING FOR PERFORMANCE NINTH EDITION There are several alternative conventions used to represent negative as 阅读全文
posted @ 2016-12-27 14:08 papering 阅读(396) 评论(0) 推荐(0)
摘要:COMPUTER ORGANIZATION AND ARCHITECTURE DESIGNING FOR PERFORMANCE NINTH EDITION Therefore, the conversion algorithm involves repeated multiplication by 阅读全文
posted @ 2016-12-27 13:17 papering 阅读(183) 评论(0) 推荐(0)
摘要:COMPUTER ORGANIZATION AND ARCHITECTURE DESIGNING FOR PERFORMANCE NINTH EDITION Hence, we convert from base 10 to base 2 by repeated divisions by 2. Th 阅读全文
posted @ 2016-12-27 13:14 papering 阅读(235) 评论(0) 推荐(0)
摘要:COMPUTER ORGANIZATION AND ARCHITECTURE DESIGNING FOR PERFORMANCE NINTH EDITION With the use of paging, truly effective multiprogramming systems came i 阅读全文
posted @ 2016-12-24 09:19 papering 阅读(257) 评论(0) 推荐(0)
摘要:https://en.wikipedia.org/wiki/Support_vector_machine In machine learning, support vector machines (SVMs, also support vector networks[1]) are supervis 阅读全文
posted @ 2016-12-14 19:33 papering 阅读(266) 评论(0) 推荐(0)
摘要:https://en.wikipedia.org/wiki/K-means_clustering k-means clustering is a method of vector quantization, originally from signal processing, that is pop 阅读全文
posted @ 2016-12-14 19:17 papering 阅读(290) 评论(0) 推荐(0)
摘要:http://www.hackerfactor.com/GenderGuesser.php#Analyze 阅读全文
posted @ 2016-12-07 16:04 papering 阅读(224) 评论(0) 推荐(0)
摘要:http://www.nltk.org/book/ch00.html After this, the pace picks up, and we move on to a series of chapters covering fundamental topics in language proce 阅读全文
posted @ 2016-12-06 20:01 papering 阅读(190) 评论(0) 推荐(0)