-
Shannon_fano_Elias
This technique doesn t involve sorting of probabilities as in Shannon-Fano coding. The following formula is used to calculate F (x) which in turn generates the code
F (x) = F(x) + p(x) / 2,
where F(x) is cummulative sum of probabilities p(x).
It can be further understood with the following C code
- 2010-08-11 04:18:23下载
- 积分:1
-
eign616
MATLAB潮流计算(MATLAB flow calculation)
- 2008-05-18 13:07:26下载
- 积分:1
-
rbf_Kmeans
Matlab环境下实现的RBF神经网络K均值聚类算法(Matlab environment to achieve the RBF neural network K-means clustering algorithm)
- 2010-03-11 08:53:34下载
- 积分:1
-
hechengdizhenjilu
说明: 合成地震记录的小程序 请大家互相学习 (Small synthetic seismogram program please learn from each other)
- 2010-04-28 10:17:13下载
- 积分:1
-
lfm11
针对宽带信号的的LFM(线性调频信号)信号的simulink仿真,包括频谱图等(I have just taken the job of the matlab simulation for the LFM signal.)
- 2013-11-05 10:49:42下载
- 积分:1
-
ATTENUATIONS
matlab file for cample bozorgnaia 2004 attenuation code
- 2013-11-07 16:31:51下载
- 积分:1
-
Short-road
遗传算法解决最短路径。在matlab中实现计算和结果输出。(The genetic algorithm to solve the shortest path. Calculated and results output in matlab.)
- 2013-04-13 19:46:16下载
- 积分:1
-
M
说明: 字典树的基本功能是用来查询某个单词(前缀)在所有单词中出现次数的一种数据结构,它的插入和查询复杂度都为O(len),Len为单词(前缀)长度,但是它的空间复杂度却非常高,如果字符集是26个字母,那每个节点的度就有26个,典型的以空间换时间结构。(The basic function of the dictionary tree data structure is used to query a number of times a word (prefix) appears in all the words, which insertion and query complexity are O (len), Len is a word (prefix) length, but its space complexity is very high, if the character set is 26 letters, and that the degree of each node will have 26, the typical structure of space for time.)
- 2013-11-29 14:28:52下载
- 积分:1
-
GEAR-CUTTING-OPERATION-IN-LATHE
gear cutting attachment ib lathe...milling and grinding
- 2014-10-07 14:09:13下载
- 积分:1
-
Dongtai
3机9节点电力系统仿真,发电机数学模型,暂态稳定计算(power system simulation by 3 generators and 9 buses)
- 2012-06-27 19:35:09下载
- 积分:1