搜索资源列表
KRUSAL
- KRUSAL算法实现最小生成数的 最小生成数的-KRUSAL algorithm generated the smallest number of the minimum number of Generation Generation smallest number of the minimum number of Generation
uuiooo
- 图的算法程序.最小生成树,最短路径等问题-map algorithm procedures. Minimum spanning tree, such as the shortest path problem
CCMPRS.ZIP
- A command-line file compression utility for Windows NT. It allows you to select files for NTFS file compression based on file name (with wild- cards), minimum file size, and/or a minimum compression ratio. You can also specify file extension
Scalable_MPEG_compression
- 本程序的目的是通过变化DCT系数以及寻找可以应用的DCT系数的最小值来进行可扩展的MPEG压缩，并且能都达到一个可以接收的效果。-the purpose of this procedure is adopted, as well as changes in DCT coefficients can be used to find the minimum value of the DCT coefficients to Progressive firms will be able to expan
Huffmancodetree
- Generates a static minimum-variance Huffman code tree.，详细给出了HUFFMAN码树构造
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
YZPack
- YZPack is Windows Portable Executable packer using aPLib v0.43 to squeeze the file s size to a minimum.
F040
- 0851F040最小系统原理图，Protel99格式，方便与做开发板或坐开发项目的使用-0851F040 minimum system schematic diagram, Protel99 format, convenient and make development board or sitting in the use of development projects
dynarray
- 动态数组应用实例。将动态数组运用于房间的计算，包括房间个数，总面积，平均面积，最大以及最小房间面积等-Dynamic array application example. Dynamic arrays used in the calculation of the room, including the room number, the total area, average size, maximum and minimum room size, etc.
cic_examp
- 对一个采样频率为45.5MHz的信号进行14倍的抽取滤波，同时进行补偿滤波器的设计，并给出CIC滤波器、补偿滤波器和级联后的频谱图 - Design a minimum-order CIC compensator that compensates... for the droop in the passband for the CIC decimator.
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
Huffman-Coding
- 哈夫曼编码(Huffman Coding)是一种编码方式，以哈夫曼树─即最优二叉树，带权路径长度最小的二叉树，经常应用于数据压缩。是指使用一张特殊的编码表将源字符（例如某文件中的一个符号）进行编码-Huffman coding (Huffman Coding) is an encoding, the Huffman tree ─ that is optimal binary tree, the minimum weighted path length of the binary tree, of
huffman
- 构造huffman树，以及找到huffman树的最优解，实现最小二叉树。-Construct huffman tree, and find the huffman tree optimal solution to achieve the minimum binary tree.
huffman
- Huffman编码又称哈夫曼编码，是一种可变长编码方式.码的原理是：将使用次数多的代码转换成长度较短的代码，而使用次数少的可以使用较长的编码，并且保持编码的唯一可解性。Huffman算法的最根本的原则是：累计的(字符的统计数字*字符的编码长度)为最小，也就是权值(字符的统计数字*字符的编码长度)的和最小。-Huffman coding, also known as Huffman coding is a variable length encoding. Code principle is: u
HuffCode
- 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
Relation
- 关系运算，内有关系性质的判断，是否自反，传递，对称。寻找最大最小，极大极小元素。还包括一个自己写的set类。-Relational operators, the judgment of the nature of the relationship is reflexive, transfer, symmetry. Find the maximum and minimum, maximum and minimum elements. Also includes a set class to wri
leachRouting.tar
- we have discussed HCTA based tracking and single hop routing and LEACH based tracking and clustering routing. LEACH based tracking is divides sensor nodes in cluster. In each cluster CH (cluster head) applies aggregation process on packets then d
ULA-pattern-synthesis
- 均匀线阵静态方向图综合，利用凸优化及其求解软件cvx，实现最低旁瓣综合，期望波束响应方向图综合（平顶主瓣），平顶主瓣旁瓣带凹口的方向图综合。-Uniform linear array static pattern synthesis using convex optimization and its solution software cvx minimum sidelobe integrated expectations beam response pattern synthesis (fla
encrypt-2013.02-install
- Jasypt (Java Simplified Encryption) is a java library which allows the developer to add basic encryption capabilities to his/her projects with minimum effort, and without the need of having deep knowledge on how cryptography works.