搜索资源列表
EZWvc
- ezw算法的实例，这里，读者重点要掌握的是EZW.C和LIST.C中的内容，充分理解零树的概念。 -ezw algorithm examples here, readers focus is to get the LIST.C EZW.C and the content and fully understands the concept of zero tree.
AdaptiveHuffman
- 自适应huffman编码，即在编/解码过程中根据已编/解码数据来计算各个码字的概率，并动态调整huffman树。包括编码器和解码器。 在vc++.net 2003下开发-adaptive Huffman coding, that is the encoding / decoding process based encoding / decoding data to calculate various code word probability, Dynamic adjustment and
pq
- 哈夫曼编码树算法-Huffman coding Tree Algorithm
霍夫曼树编码
- 哈夫曼树编码代码-Huffman code tree coding
BinaryTree
- Implementation of binary tree to use it nclude this header to your project -Implementation of binary tree to use it nclude this header to your project
kruskalMinSpanningTree
- This kruskal Minimum Spanning Tree!It s good for user in Coding Programming.-This kruskal Minimum Spanning Tree! It s good for user in Coding Programming.
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
hafuman2
- 此霍夫曼编码可根据自己输入的字符集及频度构建霍夫曼树，利用建好的哈夫曼树生成哈夫曼编码．-This Huffman code can be entered in accordance with their own character set and the frequency of Huffman tree constructed using built Huffman tree generated Huffman.
BSTREE
- all traversals in binary search tree with simple coding-all traversals in binary search tree with simple coding..
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 t
huffman-src
- Generate a Huffman Tree for an input String.
Huffman
- 构造自适应霍夫曼树实现文件的压缩与解压缩。-Adaptive Huffman tree structure for file compression and decompression.
huffman
- this is a huffman tr-huffman tree
Binary_search_tree
- Binary search tree with the function to add elements and to delete elements
Huffman-tree
- How to construct huffman tr-How to construct huffman tree
Huffman-encoding-and-decoding-tree
- 哈夫曼树编码解码，在程序中使用树结构，实现哈夫曼树，核心类：树结构类哈夫曼编解码器类；文本处理类；主程序类-Huffman encoding and decoding tree, the tree structure used in the program to achieve Huffman tree, the core categories: tree class class Huffman codec text processing classes main categories
Images-Compression-Using-Dual-Tree-Complex-Wavele
- Images Compression Using Dual Tree Complex Wavelet Transform
Compression-based-on-Huffman-tree
- 基于霍夫曼树编码的英文文本压缩，包括原创代码+技术文档+测试用例-English Text Compression Based on Huffman Tree,included original codes+technical report+some test data
Huffman tree
- 分离的哈夫曼压缩和解压功能，通过建哈夫曼树实现文件压缩和解压功能(The split Hoffman compression and decompression function, by building Hoffman tree to implement the file compression and decompression function)
Image compression using zero tree wavelet
- Image compression is a hot topic in data compression schemes. The above MATLAB codes includes technique for compressing an image with Zero Tree Wavelet Algorithm. It is a different approach than traditional ones. GUI is also included along with the m