-
c-means-algorithm
C均值算法的实现，这是我正在学习的C均值算法的实习代码，分享给大家，不当之处，欢迎指正(C-means algorithm, which I am learning C-means algorithm internship code for everyone to share, inappropriate, please correct me)
- 2013-10-29 21:15:54下载
- 积分：1
-
ex1
综合使用多种方法使模糊的人体骨架变清晰，空间图像域的增强(The integrated use of a variety of ways to obscure a clear change in human skeleton)
- 2009-06-12 15:02:40下载
- 积分：1
-
ssa
Singulaar spectrum analysis code. (a version of PCA- principal component analysis)
- 2011-05-08 02:22:05下载
- 积分：1
-
chaos_recognize_compute_forcasting
说明： 混沌性质识别判别程序，以duffing系统为例，有详细源代码(Chaotic nature of identification procedures for identifying,)
- 2011-04-14 09:19:21下载
- 积分：1
-
MATLABxinhaochuli
matlab信号处理详解，希望可以对大家有用！！！！！！(matlab signal processing Xiang Jie, I hope we can be useful! ! ! ! ! !)
- 2010-05-26 16:54:18下载
- 积分：1
-
ecgbeat
bio signal processing ECG
- 2014-11-05 21:47:32下载
- 积分：1
-
UVW_STAGE
UVW stage rotary table book
- 2015-02-25 10:36:57下载
- 积分：1
-
jietianchengxujiancuo
这是一个关于MATLAB环境下实现解调信号检错的程序(This is a MATLAB environment to achieve the demodulated signal error detection procedures)
- 2012-05-19 00:02:16下载
- 积分：1
-
VLC-using-OFDM
将OFDM技术运用在可见光通信的研究，并且把OFDM的高峰均比这一缺点进行了建设性的运用。(In
particular, the use of OFDM (orthogonal frequency division
multiplexing) for intensity modulation is investigated. The high
peak-to-average ratio (PAR) in OFDM is usually considered
a disadvantage in radio frequency transmission systems due
to non-linearities of the power amplifier. It is demonstrated
theoretically and by means of an experimental system that the
high PAR in OFDM can be exploited constructively in visible light
communication to intensity modulate LEDs. It is shown that the
theoretical and the experimental results match very closely, and
that it is possible to cover a distance of up to one meter using a
single LED.)
- 2013-11-27 16:14:24下载
- 积分：1
-
Travelling-salesman-problem-algorithm
The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
- 2013-12-30 00:26:10下载
- 积分：1
