-
mlp3
mlp rule matlab code in neural network exist in this file
- 2011-06-05 23:45:09下载
- 积分:1
-
RGBaHSV
颜色空间转换,颜色直方图信息提取,颜色空间逆变换(Color space conversion, color histogram information extraction, the color space inverse transform)
- 2013-04-16 08:52:56下载
- 积分:1
-
batch-omp
KSVDBox - Implementation of the K-SVD and K-SVD denoise algorithms.(K-SVD dictionary training.
ksvd - K-SVD dictionary training.
Signal denoising.
ompdenoise - OMP denoising.
ompdenoise1 - OMP denoising of 1-D signals.
ompdenoise2 - OMP denoising of 2-D signals.
ompdenoise3 - OMP denoising of 3-D signals.
ksvddenoise - K-SVD denoising.
Overcomplete DCT dictionary.
odctdict - Overcomplete DCT dictionary.
odct2dict - 2-D overcomplete DCT dictionary.
odct3dict - 3-D overcomplete DCT dictionary.
odctndict - Multi-dimensional overcomplete DCT dictionary.
Demonstrations.
ksvddemo - K-SVD training demonstration.
ksvddenoisedemo- K-SVD denoising demonstration.
Miscellaneous.
showdict - Display a dictionary of image patches.
ksvdver - K-SVD toolbox version information.)
- 2014-01-05 18:21:19下载
- 积分:1
-
STO_estimation
OFDM系统中符号定时偏差的估计仿真,基于cp(The estimate of the OFDM symbol timing offset in the system simulation based on cp)
- 2015-04-07 19:28:00下载
- 积分:1
-
reference_ddc_reset_virtex5_v1
wcdma 3载 ddc 对应921c文档(xapp921c, ddc wcdma)
- 2011-01-04 15:35:01下载
- 积分:1
-
rossler
rossler电路MATLAB仿真程序,分析,绘图,手动设置参数(rossler circuit simulation program MATLAB, analysis, mapping, set the parameters manually)
- 2010-12-12 11:48:17下载
- 积分:1
-
3A64P0821
This paper investigates the feasibility of Orthogonal Frequency Division Multiplexing
(OFDM) as a modulation technique for a ROF.
- 2015-02-06 00:40:19下载
- 积分:1
-
无功补偿
说明: 实现无功补偿选址,选址寻优ieee33节点(Reactive power compensation)
- 2021-01-15 13:54:00下载
- 积分:1
-
fwdzigzagfunction
zigzag function for imagecompression in matlab
- 2010-07-26 01:02:05下载
- 积分:1
-
Minimum-Cost-Flow
最小费用最大流问题是经济学和管理学中的一类典型问题。在一个网络中每段路径都有“容量”和“费用”两个限制的条件下,此类问题的研究试图寻找出:流量从A到B,如何选择路径、分配经过路径的流量,可以达到所用的费用最小的要求。(Minimum cost maximum flow problem is economics and management in a class of typical problems. Each path in a network has the " capacity" and " costs" two limiting conditions, such problems of trying to find out: Flow from A to B, how to choose the path, the path of the flow through the distribution can be achieved The use of the minimum cost requirements.)
- 2013-08-23 23:10:20下载
- 积分:1