Search - Tree - CodeBus

Search - Tree - List

[Compress-Decompress algrithms] EZWvc DL : 0: 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.
Date : 2008-10-13 Size : 11.17kb User : 马木木
[Compress-Decompress algrithms] lzss_huf DL : 0: This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially contains "space" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.
Date : 2025-12-20 Size : 3kb User : 冰冰
[Compress-Decompress algrithms] qbit DL : 0: Quad Tree Bit Plane Compression. A program to compress images. Qbit is an image viewer that loads and saves it s own imge format as well as loading various Sun Raster File, Targa and Bitmap files.-Quad Tree Bit Plane Compression. A program to compress images. Qbit is an image viewer that loads and saves it's own imge format as well as nen ding various Sun Raster File. Targa and Bitmap files.
Date : 2025-12-20 Size : 28kb User : jason..
[Compress-Decompress algrithms] LDSToolkit1.1 DL : 0: Lossless Data Compression Toolkit Version 1.1 of the lossless data compression toolkit by Nico deVries. The C sources in this toolkit include an LZW compressor, AR002 archiver, a PPM like compressor using arithmetic compression, Huffman compressor, splay tree program, and LZRW1. Quite a variety. -Lossless Data Compression Toolkit Versio n 1.1 of the lossless data compression toolkit b y Nico deVries. The C sources in this toolkit inc lude an LZW compressor, AR002 archiver. PPM like a compressor using arithmetic compres sion, Huffman compressor, splay tree program, and LZRW1. Quite a variety.
Date : 2025-12-20 Size : 94kb User : jason..
[Compress-Decompress algrithms] TreeRecovery DL : 0: 树的先序，中序排列，求树的后序排列，自己编码实现的。-Tree first order, in sequence order, and after the sequence tree with their own coding achievable.
Date : 2025-12-20 Size : 3kb User : once
[Compress-Decompress algrithms] BinaryTree DL : 0: 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
Date : 2025-12-20 Size : 2kb User :
[Compress-Decompress algrithms] kruskalMinSpanningTree DL : 0: 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.
Date : 2025-12-20 Size : 201kb User : chengbing
[Compress-Decompress algrithms] Minium_Spanning_Tree(Kruskal) DL : 0: 最小生成树问题问题描述：若要在ｎ个城市之间架设通讯网络，只需要架设ｎ－１条线路即可。如何以最低的经济代价建设这个通讯网，是一个网的最小生成树问题。设计要求：利用克鲁斯卡尔算法求网的最小生成树；以文本形式输出生成树中各条边以及它们的权值。 -The issue of minimum spanning tree problem Description: n To set up a communication network between cities, only need to set up n-1 lines can be. How to minimize the economic costs of building the communications network is a network of minimum spanning tree problem. Design requirements: the use of Kruskal algorithm for minimum spanning tree network to the text of the various forms of output spanning tree edges and their weights.
Date : 2025-12-20 Size : 192kb User : 利莉
[Compress-Decompress algrithms] hafuman2 DL : 0: 此霍夫曼编码可根据自己输入的字符集及频度构建霍夫曼树，利用建好的哈夫曼树生成哈夫曼编码．-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.
Date : 2025-12-20 Size : 3kb User : jj
[Compress-Decompress algrithms] BSTREE DL : 0: all traversals in binary search tree with simple coding-all traversals in binary search tree with simple coding..
Date : 2025-12-20 Size : 1kb User : dass
[Compress-Decompress algrithms] huffman_coding DL : 0: ) 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.
Date : 2025-12-20 Size : 1kb User : ria
[Compress-Decompress algrithms] huffman-src DL : 0: Generate a Huffman Tree for an input String.
Date : 2025-12-20 Size : 9kb User : Naya Rangel
[Compress-Decompress algrithms] Huffman DL : 0: 构造自适应霍夫曼树实现文件的压缩与解压缩。-Adaptive Huffman tree structure for file compression and decompression.
Date : 2025-12-20 Size : 6kb User : renyuanfang
[Compress-Decompress algrithms] huffman DL : 0: this is a huffman tr-huffman tree
Date : 2025-12-20 Size : 73kb User : wangwang
[Compress-Decompress algrithms] Binary_search_tree DL : 0: Binary search tree with the function to add elements and to delete elements
Date : 2025-12-20 Size : 2kb User : bob
[Compress-Decompress algrithms] Huffman-tree DL : 0: How to construct huffman tr-How to construct huffman tree
Date : 2025-12-20 Size : 8kb User : TA
[Compress-Decompress algrithms] Huffman-encoding-and-decoding-tree DL : 0: 哈夫曼树编码解码，在程序中使用树结构，实现哈夫曼树，核心类：树结构类哈夫曼编解码器类；文本处理类；主程序类-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
Date : 2025-12-20 Size : 8.37mb User : 李聪
[Compress-Decompress algrithms] Images-Compression-Using-Dual-Tree-Complex-Wavele DL : 0: Images Compression Using Dual Tree Complex Wavelet Transform
Date : 2025-12-20 Size : 596kb User : an
[Compress-Decompress algrithms] Compression-based-on-Huffman-tree DL : 0: 基于霍夫曼树编码的英文文本压缩，包括原创代码+技术文档+测试用例-English Text Compression Based on Huffman Tree,included original codes+technical report+some test data
Date : 2025-12-20 Size : 775kb User : 曾淼
[Compress-Decompress algrithms] Huffman tree DL : 0: 分离的哈夫曼压缩和解压功能，通过建哈夫曼树实现文件压缩和解压功能(The split Hoffman compression and decompression function, by building Hoffman tree to implement the file compression and decompression function)
Date : 2025-12-20 Size : 382kb User : plasticine

« 12 3 4 5 6 7 8 9 10 ... 15 »