搜索资源列表
变长记录存取类库
- 数据结构大作业——变长记录文件存取类库 设计一个类库，支持对变长记录文件的存贮、插入、删除、查找、修改等功能。-large data structure operations -- variable length records file access library design a class library, support for variable-length records document storage, insert, delete, search, modify fun
crecord
- 数据结构大作业－变长记录类库-data structure large operations - variable length record library
exm07052_1
- 本例演示：1、画两个同心圆，其中一个半径由独立输入宗量定义，另一个由变长度输入宗量的第一个元素定义，可以用任何指定的色彩线形绘制；2、变长度输入输出宗量在程序中的构成和使用；3、变长度输入输出宗量的对外使用表现-the cases demonstrated : a painting of two concentric circles, with a radius of independent input variables defined Another variable length from
lzwnhuffman
- The LZW compression class i mplemented as a fixed length code which you can specify, the huffman algorithm implementation encodes a byte into a variable length bit array. Both of them can work with streams
子集和问题
- 子集和问题.rar:这是我学算法设计时的总结,包括定长和不定长做法(也就是回朔法,剪枝限界),当然也包括穷举法.-subset and problems. Rar : This is my learning algorithm design at the conclusion, including fixed-length and variable length approach (that is, back to Schomburg, pruning Bound), which of cour
Huffman_CFile
- The code implements Huffman variable length data compression algorithm to achieve a Minimum variance encoding.
double-simpon
- 变长辛普森法求双重积分，适用于工程电磁场数值计算-Simpson method for the variable-length double points for engineering electromagnetic field numerical calculation
MATLAB
- 产生长度为1000的标准正太分布的随机信号，画出时域波形及频谱； 采用u=255的非均匀PCM编码，每符号为8bit，画输入-输出关系图； 计算信号量化噪声比（SQNR）； 信道误码率为10-3； 解码，并画出u律反变换后的信号时域波形及频谱。 扩展要求： 采用均匀PCM、量化级数可变、信道误码率可变。 - have a standard len
hafuman
- 哈夫曼编码（哈夫曼编码(Huffman Coding)是一种编码方式,哈夫曼编码是可变字长编码(VLC)的一种。）-Huffman coding (Huffman coding (Huffman Coding) is an encoding, Huffman encoding is a variable length coding (VLC) a.)
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
HuffmanCode
- 哈夫曼编码是可变字长编码(VLC)的一种。 Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长 度最短的码字，有时称之为最佳编码，一般就叫作Huffman编码。-Huffman coding is a variable length coding (VLC) a. Huffman in 1952, a coding method that occur solely on the basis of characters to construct the di
blind4qamvs
- 这是一个恒模算法和变长恒模算法收敛性比较的程序.-This is a constant modulus algorithm and variable-length constant modulus algorithm to compare the convergence process.
huffman
- huffman code implementation for variable length code allocation
shujujiegou
- 以广州旅游业为背景，设计一个变长记录文件存取类库。程序采用B+树作为索引系统，支持字节流嵌入方式和文件链接方式，以较友好的用户界面，加强程序容错性-Guangzhou tourism industry as the background, to design a variable-length record file access library. Program uses B+ tree as an indexing system to support byte-stream mode and
Desktop
- 变长记录文件存取类库的设计和实现及应用。数据结构大作业的题目。-Variable-length record file access class library design and implementation and application. Data structure the subject of large operations.
clvac
- X264中基于上下文自适应的可变长编码算法-X264 Context-based Adaptive Variable Length Coding Algorithm
test
- 两个长度不定的升序链表，两个链表中数据有可能重复，先找到混合的第n个数然后输出后续m个 （可重复），时间复杂度为n。 -Two variable-length list in ascending order, the two data are likely to repeat the list, first find the number of mixed and then output the first follow-up n m a (repeatable), the time com
Huffmancoding
- 哈夫曼在上世纪五十年代初就提出这种编码时，根据字符出现的概率来构造平均长度最短的编码。它是一种变长的编码。在编码中，若各码字长度严格按照码字所对应符号出现概率的大小的逆序排列，则编码的平均长度是最小的。（注：码字即为符号经哈夫曼编码后得到的编码，其长度是因符号出现的概率而不同，所以说哈夫曼编码是变长的编码。）-Huffman in the early fifties of last century to make such a code, depending on the probability
simple-kalmanf
- 卡夫曼编码，用于图像图形处理，是可变字长编码(VLC)的一种-Kafu Man coding for image and graphics processing, a variable word length coding (VLC) of a
1HUFFMANN
- Huffman coding is an entropy encoding algorithm used for lossless data compression. The term refers to the use of a variable-length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been