-
slmpapr23
slm method for papr ofdm.10000,working.for d=2,3.slm method for papr ofdm.10000,working.
- 2010-06-05 04:49:01下载
- 积分：1
-
laplacian_eigen
拉普拉斯特征映射，采用热核构造权重，是一种基于流行学习的非线性降维技术，可用于图像分割提高聚类的性能(Laplacian Eigenmap is a kind of nonlinear dimensionality reduction technique which based on manifold study, it choose the weights W using the heat kernel and it can be used for image segmentation to promote clustering performance.)
- 2020-12-15 16:39:13下载
- 积分：1
-
Matlab-GUI
Matlab GUI教程 初级系列（4） 文件操作 列表框 Ecxel数据读取(The Matlab GUI primary tutorial series (4) file operations the list box Ecxel data read)
- 2012-11-05 22:57:41下载
- 积分：1
-
sinx
Matlab和C++混合编程，做出sin x图形(combination of matlab and C++)
- 2010-02-26 23:22:20下载
- 积分：1
-
EMDs
emd程序 虽然有点不怎么好用，我知道那是我的水平不够(code of emd)
- 2014-10-23 20:45:27下载
- 积分：1
-
231226
空间后方交汇求解相机外方位元素，变量如下
％ x，y 控制点像点坐标
％ X，Y，Z 控制点空间坐标
％f焦距
％X0，Y0，Z0，a，b，c六个外方位元素
％x0，y0，-f内方位元素：光心坐标
％cha，chb，chc：外方位角元素改正数
％count 记录迭代次数
％R 旋转矩阵
％A 线性化的偏导系数矩阵
％L 常数项矩阵
％M0 外方位元素矩阵
％M1 外方位元素改正数矩阵(meeting space for rear camera position outside elements, as follows% variable x, y control point pixel coordinates% X, Y, Z coordinates control room focal length f%% X0, Y0, Z0, a, b, c 6 exterior orientation elements% x0, y0,- f position within elements : Optical Center coordinates% cha, chb, chc : Foreign elements azimuth correction% record count the number of iterations rotation matrix R%% A linear partial derivative of the coefficient matrix% L constant Matrix% M0 Orientation% M1 matrix elements of exterior orientation correction matrix)
- 2006-11-09 14:26:51下载
- 积分：1
-
Spy-Net
rat spynet.. um bom rat para aprendizagem
- 2014-11-18 22:08:15下载
- 积分：1
-
induction_m-_m
induction machine model in matlab coding without simulink
- 2012-10-07 21:02:36下载
- 积分：1
-
moo
2目标优化算法===================================================================================================需要自己再提哦啊试一下(two objectives optimiztion under user and fine mn tt rtg er erte eeetert e e trtertryruyr)
- 2012-01-12 14:48:46下载
- 积分：1
-
huffman
霍夫曼编码的具体方法：先按出现的概率大小排队，把两个最小的概率相加，作为新的概率 和剩余的概率重新排队，再把最小的两个概率相加，再重新排队，直到最后变成1。每次相 加时都将“0”和“1”赋与相加的两个概率，读出时由该符号开始一直走到最后的“1”， 将路线上所遇到的“0”和“1”按最低位到最高位的顺序排好，就是该符号的霍夫曼编码。(Specific methods Huffman coding: the probability of emergence of the size press line, the two smallest sum probability, as a new probability and the probability of re-queue the remaining, then the minimum of two probabilities are added, and then re-queue, until finally become one. Each time the sum will be 0 and 1 Fu added two probabilities, when read by the symbol has come to begin the final 1 , the route will encounter a 0 and 1 at the lowest to the highest bit of the right order, that is the symbol of the Huffman coding.)
- 2015-04-04 20:34:08下载
- 积分：1
|
联系客服（QQ：3324461878）
