-
DCT
Compress an decomprres DCT=Domain Transform Coding for image.
- 2009-05-19 21:48:28下载
- 积分：1
-
inttst_estimator
快速、精确频率估计算法，噪声情况下语音信号频率估计(Fast, accurate frequency estimation algorithm, the case of speech noise frequency estimation)
- 2011-09-14 21:56:16下载
- 积分：1
-
INS
惯性导航算法，有输入数据，在MATLAB下的哦，直接就可以运行得通，惯性技术作业哦!(Inertial navigation algorithm, the input data in MATLAB Oh, it can be shipped directly works, inertial technology jobs oh!)
- 2013-11-24 23:43:11下载
- 积分：1
-
Eshan-Accounting-Version
about Accounting Version 3
This guide explains how to use Eshan Accounting accounting and enterprise resource planning (ERP) software to run your business. It focuses on things an entrepreneur or business owner needs to know and do to run a real business rather than on describing each function of the software. In fact, you won’t find every little detail about Eshan Accounting here, especially if an item seems easy enough to figure out by reading the screen. Instead, you’ll see how each feature works together to run real businesses.
Some elements of an accounting system may be unfamiliar to you, especially if you don’t have an accounting background or are using an ERP for the first time. I try to explain them as I cover each one below.
- 2015-03-29 01:01:11下载
- 积分：1
-
snake
snake (active contou) operator
- 2011-06-03 17:08:04下载
- 积分：1
-
RefineAlignments
multipe sequence alignment in matlab
- 2011-10-26 00:46:07下载
- 积分：1
-
triangleThreshold
Triangle threshold method realized in Matlab environment based on Zack, G. W., Rogers, W. E. and Latt, S. A., 1977, Automatic Measurement of Sister Chromatid Exchange Frequency, Journal of Histochemistry and Cytochemistry 25 (7), pp. 741-753
- 2012-04-07 15:07:28下载
- 积分：1
-
J_UNIWARD_matlab
this simulation is a way for watermarking and steganography with j-uniward
- 2013-08-25 17:22:24下载
- 积分：1
-
CompareFFT
说明： 进行两个数据文件的FFT对比分析，可以设置分析参数，比较简单，matlab7运行通过(Two data files for comparative analysis of the FFT, you can set up analysis parameters, relatively simple, matlab7 run through)
- 2009-08-19 22:20:34下载
- 积分：1
-
dijikstra
For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
- 2012-04-12 21:01:48下载
- 积分：1
