搜索资源列表
LZW算法源码C语言
- LZW压缩算法简介 作者:宋成 描述:一篇关于LZW压缩算法简介的文章，通俗易懂，值得一看！ 备注:该文章整理自软件报1998年合订本上册。 LZW压缩算法是一种新颖的压缩方法，由Lemple-Ziv-Welch 三人共同创造，用他们的名字命名。它采用了一种先进的串表压缩不，将每个第一次出现的串放在一个串表中，用一个数字来表示串，压缩文件只存贮数字，则不存贮串，从而使图象文件的压缩效率得到较大的提高。奇妙的是，不管是在压缩还是在解压缩的过程中都能正确的建立这个串表，
423142342
- 链表与数组的数据交换 数据结构的实验基本内容 讲数组中的数存进链表-chain with an array of data exchange data structure of the basic contents of the array of speakers for storing Chain
CoinUtils-2.2.5
- The CoinUtils project is a collection of open-source utilities developed and used by a variety of other projects in the COIN-OR repository. The project includes classes for storing and manipulating sparse matrices and vectors, performing matrix facto
opencv to matlab
- cvlib_mex is a collection (over two dozens) of matlab callable routines from the the OpenCV library (www.intel.com/research/mrl/research/opencv/). OpenCV is a real time computer vision library with many image processing capabilities and it is amaz
opencv to matlab
- cvlib_mex is a collection (over two dozens) of matlab callable routines from the the OpenCV library (www.intel.com/research/mrl/research/opencv/). OpenCV is a real time computer vision library with many image processing capabilities and it is amaz
hyplas
- ************************************************************************ * * * * * THIS IS THE H Y P L A S 2.0 README FILE * * ----------------- * * * * HYPLAS is a finite element program for implicit small and large * * strain analisys of hyperelast
graph
- 有向图 采用邻接表存储 DFS和BFS方法遍历 为方便表示,结点数小于10 用V0-V9表示不同的结点的-Directed graph using adjacency list method of storing DFS and BFS traversal for the convenience that the number of nodes is less than 10 with V0-V9 for different node
HighPrecision2
- 基于STL string的高精度计算 支持以string类为存放格式的整数的多精度运算（包括+、-、*、/(整除)、％(取余)、-(取负)、乘方、开平方），部分允许string式的“整型”与int型混合运算，支持正负号，结果一律用string 型存放（多精度对单精度取余(用int)除外！）-Based on STL string of high-precision calculation of support for string-type format for storing the mu
Trie
- Trie数据结构，一种字符串存储方式，可以提高字符串的查找效率-a data structure of Trie, which can be used for storing the strings and improve the searching efficiency for a given string
hashing__
- program which uses hashing techniques for storing and retrieving the data. Input to the program: Some random numbers. Input will be from a file. Output: First the program reads all the input and store it properly using some hash techniques.
DS1643
- 非易失时间保持动态存储器，用于存储数据，双列28脚DIP。-Time to maintain the dynamic non-volatile memory for storing data, double-row 28-pin DIP.
Maths_expr215140542009
- This a simple demo of how to evaluate mathematical expressions in text format, including provision for variables and functions. The code consists of three simple classes: 1) Calc - which does the main calculations, 2) Stack - which is used t
storing_phone_no
- The program is used for storing a room/phone number into a database.Providing features such as sorting, finding the room no. Or phone no -The program is used for storing a room/phone number into a database.Providing features such as sorting, findi
Hopfield
- implement a Hopfield network for the retrieval of stored 2-D patterns-Input Parameters: Ask the user to input the number of fundamental memories p (2 ≤ p ≤ 5), the width w (3 ≤ w ≤ 5) and height h (3 ≤ h ≤ 6) of each 2-D pattern. Storage Phase: E
FFT_2_DIT_Fixed
- 程序 FFT_2_DIT_Fixed 是基2_DIT_*定点*_FFT算法，值得学习的地方很多。亮点有：倒位序采用最简单，最高效的位移操作；实现存储的旋转因子表；定点溢出处理；灵活多样的宏定义。函数调用形式：void fft(COMPLEX *x)点数在头文件以宏定义形式出现。-Program FFT_2_DIT_Fixed is based 2_DIT_* fixed* _FFT algorithm, it is worth learning a lot of places. Highligh
skiplist.c.tar
- A skip list is a data structure for storing a sorted list of items, using a hierarchy of linked lists that connect increasingly sparse subsequences of the items. These auxiliary lists allow item lookup with efficiency comparable to balanced binary se
include1
- 多项式计算（单向链表的应用） 设计要求：设计处理n次一元多项式P(x) = a0 + a1x + a2x2 + … + anxn,多项式实际上包含n+1项，由n+1个系数唯一确定。为了节省存储空间，只存储多项式中系数非0 的项。运用链表中的每一个结点存放多项式的一个系数非0项，它包含三个域，分别存放该项的系数、指数以及指向下一项结点的指针，来对其进行相应的处理（某一多项式根据x求值、多个同元多项式处理等等）。 -Polynomial calculations (one-way link
tree
- 遍历树,用于存储节点信息及其他查找树操作,仅供学习参考-Traverse the tree, for storing information and other search tree node operation, only to learn information
lian
- 大学的课程设计成果，用hash表中的链地址法和直接地址法存储学生信息。-University curriculum design results in a hash chain with the address and direct address method storing student information.
4-5-Programing-Storing
- 4-5 Programing Storing