Location:
Search - prefix tree
Search list
Description: 本程序实现通过构造一棵前缀树实现 最大模式频繁项集挖掘算法.应用fp树增长算法实现.-the program by constructing a prefix tree to achieve the greatest model Frequent Mining algorithms. Application fp growth tree algorithm.
Platform: |
Size: 46396 |
Author: 石飞 |
Hits:
Description: Linux下的tree命令，同window，功能更强大！
1、下载tree-1.5.1.1源程序
2、解压源码到工作目录tar zxvf tree-1.5.1.1.tgz
3、在tree-1.5.1.1目录交叉编译：make CC=arm-linux-gcc
4、安装：make prefix=/home/xxxx/rootfs install
Ubuntu下 直接 apt-get install tree 即可安装最新的tr
Platform: |
Size: 31589 |
Author: hhh |
Hits:
Description: 本程序实现通过构造一棵前缀树实现 最大模式频繁项集挖掘算法.应用fp树增长算法实现.-the program by constructing a prefix tree to achieve the greatest model Frequent Mining algorithms. Application fp growth tree algorithm.
Platform: |
Size: 99328 |
Author: 石飞 |
Hits:
Description: 哈夫曼树
设计2进制前缀编码的方法如下.
(1) 根据给定的n个字符以及相应的权值构造一棵最优二叉树
(2) 二叉树除了根结点以外,所有左边的分支标记 0 ,右边的分支标记为 1
(3) 对于每一种字符所对应的叶子结点找出到根结点的路径,则从根结点到此叶子结点路径上各分支字符组成的二进制数字串即为该字符的二进制前缀编码.
-Huffman prefix tree design 2-band coding method is as follows. (1) According to the given n characters and the corresponding optimal weights of a binary tree structure (2) binary tree except root node, all branch of the left marker 0, the right side of the branch marked as 1 (3) for each character corresponding to the leaf node to the root node to find the path from the root node to this leaf node of the branch path characters composed of binary digit string is the character encoding of the binary prefix.
Platform: |
Size: 1024 |
Author: 张 |
Hits:
Description: 表达式类型的实现:
1、 一个表达式和一颗二叉树之间，存在着自然的对应关系。
2、 假设算术表达式Expression内可以含有变量（a～z）、常量（0～9）和二元运算符（＋，－，*，/，^）。实现一下操作。
（1） ReadExpr(E)——以字符序列的形式输入语法正确的前缀表示式并构造表达式E。
（2） WritrExpr(E)——用带括弧的中缀表示式输出表达式E。
（3） Assign(V,c)——实现对变量V的赋值(V=c),变量的初值为0。
（4） Value(E)——对算术表达式E求值。
（5） CompoundExpr(P,E1,E2)——构造一个新的复合表达式（E1）P (E2)。
-Realize the type of expression: one, an expression, and between a binary tree, there is a natural correspondence between. 2, assuming that the arithmetic expression Expression can contain variables (a ~ z), constant (0 ~ 9) and binary operators ( ,-,*,/,^)。 You realize the operation. (1) ReadExpr (E)- sequence of characters in the form of input grammar correct prefix expressions and tectonic expression of E. (2) WritrExpr (E)- used within parentheses express output infix expression E. (3) Assign (V, c)- realize the value V of the variables (V = c), variable initial value is 0. (4) Value (E)- on the arithmetic expression E is evaluated. (5) CompoundExpr (P, E1, E2)- Construction of a new composite expression (E1) P (E2).
Platform: |
Size: 58368 |
Author: |
Hits:
Description: 关联规则中前缀树算法在VC下的实现，源代码-Association rules prefix tree algorithm in VC under the realization of the source code
Platform: |
Size: 1567744 |
Author: raul |
Hits:
Description: Linux下的tree命令，同window，功能更强大！
1、下载tree-1.5.1.1源程序
2、解压源码到工作目录tar zxvf tree-1.5.1.1.tgz
3、在tree-1.5.1.1目录交叉编译：make CC=arm-linux-gcc
4、安装：make prefix=/home/xxxx/rootfs install
Ubuntu下 直接 apt-get install tree 即可安装最新的tr-Linux under the tree order, with the window, more powerful! 1, tree-1.5.1.1 source code download 2, extract the source to the working directory tar zxvf tree-1.5.1.1.tgz3, in the tree-1.5.1.1 directory cross compiler: make CC = arm-linux-gcc4, install: make prefix =/home/xxxx/rootfs installUbuntu directly under the apt-get install tree to install the latest tr
Platform: |
Size: 31744 |
Author: hhh |
Hits:
Description: 自己编的，输入前缀树，基于WordNet，需先安装wordnet-Own, and enter the prefix tree, based on the WordNet, the need to install WordNet
Platform: |
Size: 542720 |
Author: chanfangliang |
Hits:
Description: 前缀表达式转换成二叉树的代码，通过转换成二叉树可以轻松实现转换成后缀，前缀，中缀形式。-Prefix expression into a binary tree code, through the binary tree can be converted easily into a suffix, prefix, infix form.
Platform: |
Size: 3072 |
Author: wxg |
Hits:
Description: ) 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.
Platform: |
Size: 1024 |
Author: ria |
Hits:
Description: 将前缀表达式转为中缀表达式，并画出所建的树-To prefix infix expression to expression, and draw the tree built
Platform: |
Size: 306176 |
Author: arthur |
Hits:
Description: Prefix tree implementation code using c#-Prefix tree implementation code using c#
Platform: |
Size: 28672 |
Author: bwe |
Hits:
Description: 算术表达式与二叉树之间存在着对应关系，编写把以前缀形式输入的合法算术表达式转换为中缀表达式，再转换为后缀表达式，并求表达式的值-Arithmetic expressions with binary tree there is a correlation between the preparation of the form to enter the legitimate prefix arithmetic expression conversion infix expression, and then converted to suffix expressions and expressions for the value of
Platform: |
Size: 1024 |
Author: ty |
Hits:
Description: A program to find association rules and frequent item sets (also closed and maximal) with the apriori algorithm (Agrawal et al. 1993), which carries out a breadth first search on the subset lattice and determines the support of itemsets by subset tests. This is a pretty fast implementation that uses a prefix tree to organize the counters for the item sets. The census data set may be used to test the program.
Platform: |
Size: 123904 |
Author: hjp |
Hits:
Description: 对数据结构中二叉树的理解，前缀、中缀、后缀的相互转换.-Binary tree data structure understanding, prefix, infix, suffix interchangeable.
Platform: |
Size: 118784 |
Author: 亮亮 |
Hits:
Description: 用于ip地址管理的二叉前缀树实现，按前缀区分ip地址，用于存储中型前缀列表-Ip address management for the binary prefix tree to achieve, according to differentiate between prefix ip address prefix list used to store medium-sized
Platform: |
Size: 13312 |
Author: 李晏 |
Hits:
Description: 实现表达式求值，表达式树绘制，前缀表达式转换中缀表达式，中缀表达式转换后缀表达式-To achieve expression evaluation, expression tree drawing, prefix expression conversion infix expression, the expression postfix conversion infix expression
Platform: |
Size: 138240 |
Author: 陈义兵 |
Hits:
Description: 关于字符串的数据结构应用，有kmp，扩展kmp，单词前缀树的近似kmp，后缀数组。求最多重复子串。-On the string data structure applications, kmp, expansion kmp, word prefix tree approximation kmp, suffix array. Seeking up to repeated substring.
Platform: |
Size: 4096 |
Author: Mr.Only |
Hits:
Description: Trie，又称单词查找树、前缀树，是一种哈希树的变种。应用于字符串的统计与排序，经常被搜索引擎系统用于文本词频统计-Trie, also known as the word search tree, the prefix tree, is a variant of the hash tree. Applied statistics and sorting of strings, often by the search engine system for text word frequency statistics
Platform: |
Size: 97280 |
Author: shangzai |
Hits:
Description: Trie是一种树型数据结构，用于存储字符串，可以实现字符串的快速查找。Trie的核心思想是空间换时间，利用字符串的公共前缀来降低查询时间的开销以达到提高效率的目的。
适用范围：统计和排序大量的字符串-Trie is a tree data structure used to store the string, the string can quickly find. Trie' s core idea is space for time, use the string prefix to reduce the public cost of the query time to achieve the purpose of increasing efficiency. Scope: Statistics and sorting a large number of strings
Platform: |
Size: 1024 |
Author: 咋都有 |
Hits: