资源列表
yule_walkemethodPSD
- 基于yule_walker方程的空间谱估计算法，对学习空间谱估计与天线阵列的朋友会有帮助：）-yule_walker equation based on the spatial spectrum estimation algorithm right learning space spectrum estimation antenna array and friends will be helpful :)
FFT_2
- 使用C语言详细实现了两种不同的快速傅立叶变换算法，可以清楚地理解算法原理。-use of C language in detail to achieve two different fast Fourier transform algorithm, we can clearly understand algorithm principle.
waveletcharactor
- 本程序通过小波的方法提取小波包特征参数，希望对研究小波的朋友有益处：）-the procedure wavelet extraction wavelet packet parameters, and I hope to study wavelet friends have benefits :)
LBTree
- 用VC。NET2005实现优秀的最近邻搜索算法LB-TREE的模拟和图形显示。具有建立优良数据结构和搜索功能-VC.NET2005 achieve outstanding nearest neighbor search algorithm LB-TREE simulation and graphics. With excellent data structure and search functions
ZBZHandXDDX
- 这是用于遥感数据处理中的相对定向及绝对定向及坐标的七参数转换的程序。具有一定代表性，欢迎试用。-This is for the processing of remote sensing data on the relative and absolute directional and directional coordinates of the seven parameters of the conversion process. Certain representative, welcomed
KeplerOrbit
- 这是用于计算天文中的开普勒轨道元素的程序，用MAtlab编写的，欢迎使用哦。-This is used to calculate the astronomical elements Kepler track procedures used MAtlab prepared, Welcome oh.
Resecl
- 这是用于遥感影像的后方交汇计算的程序，欢迎使用。-This is used for remote sensing images of the rear intersection calculation procedures, the use of welcome.
Mp3_layer3yuanma
- VC写的Mp3 解码源码和layer3编码源码；重要用于U盘开发。内含帮助文件。-VC write Mp3 source decoder source code and layer 3; Important for the development of U disk. Intron help files.
wave123
- 图像压缩在MATLAB中的处理源代码。虽然较短-image compression in the treatment MATLAB source code. Although shorter
DTK-FFT11111
- seed傅立叶变换程序，5402 ，请大家共享给与反馈-seed Fourier transform procedure, 5402, please give feedback share
LISS_FAST
- 时间复杂度为O(nlogn)的最长单调递增子序列问题的计算程序。不是动态规划算法。在一分钟之内可以计算n=10^6个元素的递增子序列。-time complexity of O (nlogn) of the longest-monotonically increasing sequence of the program. Is not dynamic programming algorithm. In a minute can be calculated n = 10 ^ 6 elements
Fast_Joseph
- 时间复杂度为O(nlogn)的Joseph排列问题的计算程序。程序的运行时间与m无关。在一分钟之内可以计算n=10^6,m任意的Joseph排列问题.-time complexity of O (nlogn) Joseph problems with the program. Procedures for the running time has nothing to do with the m. In a minute can be calculated n = 10 ^ 6, m arbit