-
Multivariable_Function_Extremum_with_MATLAB
根据高等数学求多元函数极值的思想,编写相应的MATLAB求极值程序。三个例子源自同济版《高等数学》中例题。(According to the Multiple Functions of Higher Mathematics extreme ideas, to prepare the corresponding MATLAB for extreme process. Three examples from Tongji Edition "Higher Mathematics" in the example.)
- 2010-05-12 23:28:51下载
- 积分:1
-
New-Folder-(7)
this code shows the gives the excel sheet of required parameter as given in the code for show the comparison ...............by pandey ji
- 2011-05-08 15:29:36下载
- 积分:1
-
bpsk_and_or_most
matlab环境下不同的融合判决算法在不同SNR环境下的性能(matlab environment, the integration of different decision algorithms performance under different SNR)
- 2011-05-20 10:15:03下载
- 积分:1
-
1
说明: find all bases of digraph
- 2011-05-27 14:01:29下载
- 积分:1
-
MATLABPGUI
Matlab GUI界面编程,Matlab GUI界面编程(matlab GUI)
- 2012-05-31 10:08:27下载
- 积分:1
-
Home-Security-System-
主要是家庭安全系统的matlab程序,供大家更好的学习和了解家庭安全系统的搭建(Home security systems are mainly matlab program for everyone to build a better understanding of learning and home security systems)
- 2015-03-17 17:31:42下载
- 积分:1
-
EfficientFrontierGUI
Efficient frontier from Yahoo or database data. (Efficient frontier from Yahoo or database data.)
- 2008-01-15 06:33:04下载
- 积分:1
-
huffman_coding
) Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
() Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
)
- 2009-04-04 22:16:39下载
- 积分:1
-
test4_wavelet_DIPUM
用二维小波包分解得到水平垂直细节系数,据此组合合成图像的边缘,并与传统算子方法对比(Two-dimensional wavelet packet decomposition has been the level of vertical detail coefficient, which images the edge of combinatorial chemistry and operator with the traditional methods)
- 2009-05-15 13:18:07下载
- 积分:1
-
ccsystems2e_Chapter09
现代通信系统(matlab版)(第二版)配套源代码
John G. Proakis等著 刘树棠 译 电子工业出版社出版(modern communication system (Matlab version) (2nd Edition) source code supporting John G. Proak Liushutang is waiting for the translation of the electronics industry published)
- 2007-05-17 21:22:28下载
- 积分:1