资源列表
GLRAM
- 算法实现:Jieping Ye. Generalized low rank approximations of matrices. Machine Learning, Vol. 61, pp. 167-191, 2005. -Algorithm : Jieping Ye. Generalized low rank approximatio ns of matrices. Machine Learning, Vol. 61. pp. 167-191, 2005.
mofangxxxx
- 构造奇数阶魔方的简便方法c++实现.方法独特,很巧妙!-structure of the odd order Cube c simple method to achieve. Unique method, is a clever!
turboMS
- 信道编码 本文件为turbo码的c语言程序！-channel coding of this document for turbo codes c language program!
pcnn
- 这是pcnn用于边缘检测的matlab源代码，希望对大家有用。-edge detection for the Matlab source code, we hope that the right useful.
4.8kCELPcoder.tar.gZ
- 4.8kcelp语音压缩编码程序，不错的借鉴，原理可参见王炳锡书《语音编码》-4.8kcelp speech coding procedures, a good reference, Wang Bingxi principle can be found in "Speech Coding"
C54adpcm
- TMS320C54实现的ADPCM DSP实现程序，包括测试文件-realized ADPCM TMS320C54 DSP procedures, including test paper
prime_number_upright
- 质数竖式 下面的竖式是一个乘法运算问题，它的每个＊号可以代入一个数字， 这个数字属于一个特定的由N个数字组成的集合。如果这个集合是｛2，3，5，7｝， 那么这个竖式称作“质数竖式”。 此程序就是为了解决这样一个问题而做的。-few quality below the vertical shaft is a multiplication problem, it * can each generation into a number of This is a specific N-d
fractionTodecimal
- 因为所有的分数都是有理数，所以一个分数要么除尽，要么有循环节,这个程序很好地解决了这个问题。-because all the scores are rational, or a fraction of thirteen, or a cycle of festivals, this procedure to solve the problem.
fractions_compositor
- 写一个程序，列出在0和1之间的所有分母不大于N的最简分数，下面是N＝5时的情况： 0/1 1/5 1/4 1/3 2/5 1/2 3/5 2/3 3/4 4/5 1/1 总共有11个分数! 还需要进行排序。-write a procedure set out in the 0 and 1 denominator between all the N is not greater than the most simple level, Below is N = 5:00 of : 0 /
factorialxxxyy
- 一个最优化的大数阶乘算法,可以计算超过5位数的阶乘,而运算时间只需几秒。-an optimization of large factorial algorithm can calculate the median of over 5 factorial, and the computation time only a few seconds.
baiduzhixing
- 2005百度之星程序设计大赛总决赛题目解答-2005 Baidu Star Program Design Contest Finals topic answers
fdtd_2D_TE_PML
- fdtd的2d算法，pml边界条件，二维TE波-fdtd the 2d algorithm, pml boundary conditions, 2D TE wave