Search - WORD - CodeBus

Search - WORD - List

[Compress-Decompress algrithms] AdaptiveHuffman DL : 0: 自适应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 Huffman tree. Including the encoder and decoder. In vc. Net 2003 under development
Date : 2008-10-13 Size : 12.85kb User : 沈宏伟
[Compress-Decompress algrithms] VC++word DL : 0: 此代码可在vc++环境下写五颜六色的三维汉字-this code in vc environment write Chinese characters colorful 3D
Date : 2008-10-13 Size : 63.69kb User : 杨小军
[Compress-Decompress algrithms] 2000121004003 DL : 0: 结构化存储文件我们平时大量接触的Word,Excel文件实际上都是结构化存储文件，用这个示例程序你也可以创建自己的结构化存储文件-structured document storage we usually contact with the Word, Excel files are actually structured storage of documents, use this sample program you can create your own document storage structure
Date : 2008-10-13 Size : 35.59kb User : lyyyyy
[Compress-Decompress algrithms] 23952 DL : 0: My (so called) HiP compression algorithm as console mode utility. It s a hybrid of Lempel-Ziv 77 and Adaptive Huffman encoding (Huffman + LZ77 ZIP = HiP) with a word prefix hash algorithm etc.-My (so called) a compression algorithm HiP 's console mode utility. It's a hybrid of Lempel-Z iv 77 and Adaptive Huffman encoding (Huffman LZ HiP ZIP = 77) with a word prefix hash algorithm et c.
Date : 2008-10-13 Size : 52.26kb User : 郭春阳
[Compress-Decompress algrithms] PBWORD DL : 0: 一个小程序，能够实现在pb中导出word文件，简单实用。-a small procedure can be achieved in pb derived word documents, simple and practical.
Date : 2008-10-13 Size : 13.79kb User : ruan
[Compress-Decompress algrithms] SPLITT DL : 0: 大型文件分割组合 C 语言源程序，其中有一个英文word说明-large document segmentation portfolio C language source files, which is an English word note
Date : 2008-10-13 Size : 15.22kb User : 杨晓
[Compress-Decompress algrithms] zaitupianshangtianjiabioji DL : 0: 如何绘制阴影字以及对文字的处理,图片上的文字处理-how shadow rendering of text and word processing, photo of a word processing
Date : 2008-10-13 Size : 835.65kb User : oyyee
[Compress-Decompress algrithms] ahword97 DL : 0: 一个好的word的控件-a good word of Control
Date : 2008-10-13 Size : 49.47kb User : 张鲲
[Compress-Decompress algrithms] qmdjyy101 DL : 0: 文档转换软件，可将常用的文档格式如word转换成pdf,十分方便。
Date : 2008-10-13 Size : 739.48kb User : shen
[Compress-Decompress algrithms] Ason DL : 0: TSP货郎担过河问题，解压后有word文档
Date : 2008-10-13 Size : 3.43kb User : 陳義照
[Compress-Decompress algrithms] yiyuanxishuduoxiangshi DL : 0: 一元稀疏多项式计算器的一个WORD文档的大解析
Date : 2008-10-13 Size : 153.34kb User : luzhiqin
[Compress-Decompress algrithms] LOSSY DL : 0: Data compression using a word-based model and revised arithmetic coding method.
Date : 2008-10-13 Size : 67.7kb User : 吴天
[Compress-Decompress algrithms] 文本与二值图像的游程压缩[xtulbd,050418] DL : 0: 【文本与二值图像的游程】1. 文本游程压缩的原理对重复字段采用3符号标识法：(1) 重复提示符,比如@,#等；(2) 游程长度参数或重复次数,若用一个字节表示,最大长度可为255个重复字；(3) 重复字符。以上三部分合称为重复因子。可见要获得压缩效益，重复字符应在3个以上。2. 图像游程压缩的原理对于二值图像，原始数据为零一矩阵，压缩时逐行处理该矩阵：(1) 连续n个1，表示为+n；(2) 连续n个0，表示为-n。-text and binary image -- an outbound trip. Yu Cheng text compression principle on repeated field using three symbols logo Act : (a) repeat prompt, such as @, #, etc.; (2) Run-length parameters, or the number of repeat, if using a byte, the largest the length of 255 to repeat the word; (3) repeat characters. More than three as part of a repeat factor. Visibility to gain compression efficiency, duplication of characters in three more. 2. Run-image compression for the principle of two binary images, a zero original data matrix, progressive compression deal with the matrix : (1) n a row, n; (2) consecutive n 0, expressed as-n.
Date : 2008-10-13 Size : 153.8kb User : 李勃东
[Compress-Decompress algrithms] 哈夫曼编码解码 DL : 0: 霍夫曼编码是可变字长编码(VLC)的一种，是消除编码冗余最常用的方法。它是Huffman于1952年提出一种编码方法，它的基本原理是频繁使用的数据用较短的代码代替，较少使用的数据用较长的代码代替，每个数据的代码个不相同。有时称之为最佳编码，一般就叫作Huffman编码。下面引证一个定理，该定理保证了按字符出现概率分配码长，可使平均码长最短。-Huffman coding is a variable word length coding (VLC) A is to remove redundant code of the most commonly used methods. It is Huffman in 1952 made a coding method, and its basic tenets are frequently used data with the code instead of a shorter, less use of the data over a longer period instead of the code, the code for each data-not the same. Sometimes referred to as the best coding, the general called on Huffman coding. Below prove a theorem, the theorem guarantees by the characters emerging probability distribution yards long, will enable the shortest average yards long.
Date : 2008-10-13 Size : 23.47kb User : 胡骥骏
[Compress-Decompress algrithms] ahword97 DL : 0: 一个好的word的控件-a good word of Control
Date : 2025-12-19 Size : 49kb User : 张鲲
[Compress-Decompress algrithms] VC++word DL : 1: 此代码可在vc++环境下写五颜六色的三维汉字-this code in vc environment write Chinese characters colorful 3D
Date : 2025-12-19 Size : 1.25mb User : 杨小军
[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-19 Size : 1kb User : ria
[Compress-Decompress algrithms] word-to-pdf-converter DL : 0: 一款很好的将word文档转换为PDF格式的软件-a very good software for transform word into PDF
Date : 2025-12-19 Size : 11.7mb User : libin
[Compress-Decompress algrithms] PDF2Word(pdf-to-word)_V3.0-- DL : 0: PDF2Word(pdf to word)_V3.0 汉化版-PDF2Word (pdf to word) _V3.0 Chinese Version
Date : 2025-12-19 Size : 4.17mb User : 姚洋
[Compress-Decompress algrithms] automatic-word-segmentation DL : 0: 实现一个中文自动分词程序，所使用的编程语言不限选作：对人名，地名，机构名的识别下载北大计算语言所标注的99年人民日报分词语料库，构建一个词表实现正向、逆向最大分词算法-To implement a Chinese automatic word segmentation procedure, used by any programming language Chosen for: the person names, place names, organization name recognition Download calculation language annotation of Peking University in 99 the People s Daily participle corpus, to build a glossary Achieve forward, reverse maximum segmentation algorithm
Date : 2025-12-19 Size : 416kb User : 黄艳玲

« 12 3 4 »