-
sky_lin
说明： 这是一些例程，包括了汇编、m文件，如对站有帮助，则无比荣幸
(This is some routines, including a compilation, m documents, such as the right, there is help, incomparable honor)
- 2006-05-12 10:36:45下载
- 积分：1
-
SIFT
sift algorithm for detection of object even in different orientations
- 2011-09-09 21:58:02下载
- 积分：1
-
Comm_system
Communication channel + TX + RX design for picture transfer
- 2013-08-10 01:01:16下载
- 积分：1
-
Matlab
很好的一本matlab书籍，从入门到精通，欢迎下砸(
Matlab a good book, entry to the master, welcome to drop down)
- 2015-01-15 15:52:47下载
- 积分：1
-
328277
一个QPSK的仿真程序,使用的是COSTAS环来恢复载波,给予SIMULINK()
- 2018-06-08 07:23:33下载
- 积分：1
-
指纹定位算法仿真
基于WLAN的室内指纹定位算法仿真分析，包括KNN法,NN法,贝叶斯算法，模糊聚类法等，实验中建立模拟数据库，为验证定位算法性能的实验阶段做准备。采用MATLAB软件进行仿真各种算法的定位结果，并通过改变参数和环境噪声，对各种定位算法及其改进算法的性能进行比较分析。
- 2022-04-26 21:00:28下载
- 积分：1
-
ML_tutorial
ebook for matlab learning
- 2011-11-19 21:24:00下载
- 积分：1
-
myspecgram
To see an spectrogram of a signal non perodical
- 2009-05-08 18:55:38下载
- 积分：1
-
Data_fusion
为了获得更加准确的估计位置,对一种基于数据融合的定位解算算法进行了研究,在将模拟退火算法与经典的泰勒级数展开法和Chan氏算法进行性能比较的基础上,将模拟退火算法与上述两种经典的位置解算算法相结合,通过构造多算法协同定位模型,并基于该模型设计了融合定位算法,对传统定位解算算法进行改进,提出了一种基于数据融合的定位解算算法。仿真结果表明,融合算法的定位精度优于非融合算法且运算量较小(In order to obtain more accurate estimates of the location of a data fusion-based positioning solver algorithm is studied in the simulated annealing algorithm with the classical Taylor series expansion method and Chan' s algorithms performance comparison based on simulated annealing algorithm with the above-mentioned two kinds of classical solution calculate the location of the Combination, by constructing a multi-algorithm co-location model, and model design based on the location of the fusion algorithm, the traditional location solver algorithm is proposed to improve a position based on data fusion solver algorithm. Simulation results show that the positioning accuracy of better than fusion fusion algorithm and the computation of non-small)
- 2010-02-06 22:23:43下载
- 积分：1
-
ltsa
LTSA[19] is based on the intuition that when a manifold is correctly unfolded, all of the tangent hyperplanes to the manifold will become aligned. It begins by computing the k-nearest neighbors of every point. It computes the tangent space at every point by computing the d-first principal components in each local neighborhood. It then optimizes to find an embedding that aligns the tangent spaces.
- 2011-01-23 02:19:08下载
- 积分：1
|
联系客服（QQ：3324461878）
