搜索资源列表
Maxfpminer1
- 本程序实现通过构造一棵前缀树实现 最大模式频繁项集挖掘算法.应用fp树增长算法实现.-the program by constructing a prefix tree to achieve the greatest model Frequent Mining algorithms. Application fp growth tree algorithm.
tree
- 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
SET
- 自己编的，输入前缀树，基于WordNet，需先安装wordnet-Own, and enter the prefix tree, based on the WordNet, the need to install WordNet
qianzhuizhuanerchashu
- 前缀表达式转换成二叉树的代码，通过转换成二叉树可以轻松实现转换成后缀，前缀，中缀形式。-Prefix expression into a binary tree code, through the binary tree can be converted easily into a suffix, prefix, infix form.
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
Article_demozip
- Prefix tree implementation code using c#-Prefix tree implementation code using c#
tree
- 算术表达式与二叉树之间存在着对应关系，编写把以前缀形式输入的合法算术表达式转换为中缀表达式，再转换为后缀表达式，并求表达式的值-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 t
apriori
- 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 tes
Expr
- 对数据结构中二叉树的理解，前缀、中缀、后缀的相互转换.-Binary tree data structure understanding, prefix, infix, suffix interchangeable.
prefix_tree
- 用于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
ProExpr
- 实现表达式求值，表达式树绘制，前缀表达式转换中缀表达式，中缀表达式转换后缀表达式-To achieve expression evaluation, expression tree drawing, prefix expression conversion infix expression, the expression postfix conversion infix expression
string_structure
- 关于字符串的数据结构应用，有kmp，扩展kmp，单词前缀树的近似kmp，后缀数组。求最多重复子串。-On the string data structure applications, kmp, expansion kmp, word prefix tree approximation kmp, suffix array. Seeking up to repeated substring.
Trie
- 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 s
trie-tree
- 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 t
HuffmanCoding
- The program uses Huffman code algorithm to compress any file (text file, image file, ...) by creating a optimal prefix tree. The user interface is very simple to process encoding a file or decoding a file.
fpgrowth_linuxExecutable
- Linux executable file.. A program to find frequent item sets (also closed and maximal as well as generators) with the FP-growth algorithm (frequent pattern growth, Han et al 2000), which represents the transaction database as a prefix tree which
algorithms-master
- 1. 经典的算法实现 2. 服务器端 3. 正确，易于使用和改造, 一个头文件一个算法，并附带一个demo. 1. 一个算法用一个.h文件表示放到include下.2. 算法演示的demo程序放到src下.3. 程序正确通过后，请发起Pull Requests，代码被验证后入库，并在README中发布新算法实现。 已实现 ( Implemented ): Array shuffle Prime test(trial division) Prime test(Mi
pre
- 用java编写的前缀树挖掘算法源代码，包括6个java源文件及编译文件，数据文件，输出结果txt文件-Prepared using java prefix tree mining algorithm source code, including six java source files and compiled files, data files, the output txt file
Source-Code
- 请使用OpenNLP当中的英文文档，en-sent.bin 以便进行英文断句。 请使用OpenNLP当中en-token.bin 以便进行英文单词的tokenlization. 系统的启动代码名称是Command collect center-NGram Model based on add-delt smooth tec. the datastructure of NGram model s memony structure is using prefix tree as inde
184081165-16-Bit-Wave-Pipelined-Sparse-Tree-RSFQ-
- In this system, we discuss the architecture, design, and testing of the first 16-bit asynchronous wave-pipelined sparse-tree superconductor rapid single flux quantum adder implemented using the ISTEC 10 kA/cm 2ADP2.1 fabrication process. Compar