-
TND309-D
General Information for MECL 10H and MECL 10K
- 2010-07-13 02:26:52下载
- 积分:1
-
wireless_tips_and_tricks
I ve decided to produce this list of wireless tips and tricks to benefit the
first time or seldom user of Matlab interested in wireless
and communication design.(I' ve decided to produce this list of wireless tips and tricks to benefit the first time or seldom user of Matlab interested in wireless and communication design.)
- 2009-10-09 09:14:59下载
- 积分:1
-
face_detection
This is a source code for face recognition.
- 2012-05-02 04:08:54下载
- 积分:1
-
mulimodel-data-and-feature-selection
多模态数据的特征提取方法:时间序列数据及DTW高斯核,图像数据及直方交核 和字符串数据及字符串核(Feature extraction method of multi modal data, time series data and DTW Gauss, the image data and the histogram intersection kernel and string data and String Kernel)
- 2015-04-11 21:48:31下载
- 积分:1
-
MATLAB_program_electronic_document_interpolation_a
MATLAB程序插值算法电子文档MATLAB program electronic document interpolation algorithm(Interpolation algorithm MATLAB program electronic document MATLAB program electronic document interpolation algorithm)
- 2010-08-02 13:59:19下载
- 积分:1
-
fastICA
fastICA algorithm,blind signal processing helpful
- 2011-05-11 19:46:59下载
- 积分:1
-
MatlabandC
Matlab与C混合编程实现Type2模糊系统,文献资料(Matlab and C mixed programming Type2 fuzzy systems, literature)
- 2010-05-19 14:49:44下载
- 积分:1
-
TD4-analyse-de-stabilite-en-BF
AN IMPORTANT class of theoretical and practical
problems in communication and control is of a statistical nature.
- 2015-03-15 00:08:40下载
- 积分:1
-
MOGA
用于解决多目标优化问题,是一个很不错的代码,给大家分享一下(MOGA Problem)
- 2012-01-03 16:13:58下载
- 积分:1
-
path_discovery
自己编写的利用matlab实现无线自组织网AODV仿真的算法源码。
为由50个节点构成的网络。在50m×50m大小的区域内,随机的产生50个节点。由用户指定源节点和目的节点,程序负责给出从源节点到目的节点的最小路径和此路径的跳数。各个节点之间设定为只要在自己直接通信范围内的其它节点,均一跳可达。(Write your own realization of the use of matlab simulation of wireless self-organizing network algorithms AODV source. The grounds of a network of 50 nodes. Size of 50m × 50m in area, randomly generated 50 nodes. By the user to specify the source node and destination node, the program responsible for the given node from the source node to the destination path and this path is the minimum number of hops. Set between each node to communicate directly as long as within the scope of their other nodes, all jump up.)
- 2021-04-15 16:08:55下载
- 积分:1