资源列表
Huffuman_decoding
- 哈夫曼解码，主要应用于数字图像的压缩编码。-Huffman decoding, mainly used in digital image compression coding.
2008_11_19
- 用java刚刚写了不久的学生管理系统，网站上载的，推荐一下，对初学者，很有帮助-Using java just wrote a long student management systems, website contained recommend what, for beginners, very helpful
divtuozhuai
- javascr ipt实现的div拖拽 大约65kb大小-javascr ipt drag and drop div realized the size of about 65KB
MATLAB
- 一些基本函数的实现 和多种数字滤波器的实现-Some of the basic function of a variety of digital filter realization and the realization of
CZipFileExe_kkk
- 解压缩代码库，非常好用，可以写自己的解呀缩等等程序。代码很漂亮-Extract the code base, very easy to use, you can write their own solution of it and so procedural reduction. Beautiful code
newsoccerleague
- 在线足球社区，支持球员增删改查，球队增删改查-Online football community, to support the player additions and deletions to the investigation, the team additions and deletions to search
CompressDll
- 具有数据压缩和解压缩功能的地动态库。 采用Delphi内置的压缩库实现。压缩效率略低于zip。-With data compression and decompression functionality to dynamic libraries. The use of Delphi
huffman
- 问题描述] 利用哈夫曼编码进行信息通信可以大大提高信道利用率，缩短信息传输时间，降低传输成本。但是，这要求在发送端通过一个编码系统对待传数据预先编码，在接收端将传来的数据进行译码（复原）。对于双工信道（即可以双向传输信息的信道），每端都需要一个完整的编/译码系统。试为这样的信息收发站写一个哈夫曼编/译码系统。-Descr iption of the problem] use Huffman encoding of information and communication can grea
AMR(2009.1.9)
- TS 26.104 3GPP AMR音频文件压缩、解压算法-TS 26.1043GPP AMR audio file compression, decompression algorithm
Minium_Spanning_Tree(Kruskal)
- 最小生成树问题 问题描述：若要在ｎ个城市之间架设通讯网络，只需要架设ｎ－１条线路即可。如何以最低的经济代价建设这个通讯网，是一个网的最小生成树问题。 设计要求：利用克鲁斯卡尔算法求网的最小生成树；以文本形式输出生成树中各条边以及它们的权值。 -The issue of minimum spanning tree problem Descr iption: n To set up a communication network between cities, only need to
HMLZW
- this a haffman code that can compress any file.
2008121502
- 730904374X 73 0904374X -730904374X 73 0904374X