Location:
Search - trie
Search list
Description: 基于双数组Trie（Double-Array Trie）的词典查询算法 PPT
Platform: |
Size: 450530 |
Author: 童小军 |
Hits:
Description: 1． Trie树作为一种索引树，这种结构对于大小变化很大的关键字特别有用。利用Trie树实现一个英语单词辅助记忆系统，完成相应的建表和查表程序。2． 不限定Trie树的层次。每个叶子结点只含一个关键字，采用单字符逐层分割的策略，实现Trie树的插入、删除和查询的算法，查询可以有两种方法：查询一个完整的单词或者实现以某几个字母开头的单词。
Platform: |
Size: 75773 |
Author: 蒋笑语 |
Hits:
Description: Trie树既可用于一般的字典搜索，也可用于索引查找。对于给定的一个字符串a1,a2,a3,...,an.则采用TRIE树搜索经过n次搜索即可完成一次查找。不过好像还是没有B树的搜索效率高，B树搜索算法复杂度为logt(n+1/2).当t趋向大，搜索效率变得高效。怪不得DB2的访问内存设置为虚拟内存的一个PAGE大小，而且帧切换频率降低，无需经常的PAGE切换。
Platform: |
Size: 1254 |
Author: ruikobe |
Hits:
Description: lc-trie 路由查找算法， lc-trie 路由查找算法
Platform: |
Size: 1224160 |
Author: 陈涛 |
Hits:
Description: 数据挖关联规则，发现数据间的关系，如超市的数据-data dredging association rules, found the relationship between data, such as supermarket data
Platform: |
Size: 1024 |
Author: 张烨 |
Hits:
Description: 双数组辞典生成程序。利用双数组实现trie算法，对于不定长度共同前缀查询情况，比哈希方法更为有效。经常用于分词辞典的制作。-array dictionary-generation procedures. Using two arrays to achieve Trie algorithm for the indefinite length of the inquiry common prefix than Hash methods more effective. Frequently used in the Word dictionary produced.
Platform: |
Size: 237568 |
Author: 姜锋 |
Hits:
Description: 基于双数组Trie（Double-Array Trie）的词典查询算法 PPT-Array-based dual-Trie (Double-Array Trie) dictionary query algorithm PPT
Platform: |
Size: 450560 |
Author: 童小军 |
Hits:
Description: trie tree, 是一个高效处理字符串的比较常见的算法,能够让我们在复杂度 O(log(n))的情况下插入和查询一个字符串-trie tree, is an efficient treatment of the more common string algorithms, to enable us to the complexity of O (log (n)) the case of insert and query a string
Platform: |
Size: 1024 |
Author: hekui |
Hits:
Description: 用Trie树构建英文字典? 肨rie树构建英文字典用Trie树构建英文字典-Trie tree used to build an English language dictionary?肨rie tree constructed English dictionary?肨rie trees used to build English Dictionary English Dictionary Trie Tree Construction
Platform: |
Size: 3072 |
Author: |
Hits:
Description: 什么是Trie树？
Trie树的性质和特点
Trie树的实现
Trie树是做什么的？
-What is the Trie tree? Trie tree of the nature and characteristics of the realization of Trie tree Trie tree is doing what?
Platform: |
Size: 232448 |
Author: tearnon |
Hits:
Description: 1． Trie树作为一种索引树，这种结构对于大小变化很大的关键字特别有用。利用Trie树实现一个英语单词辅助记忆系统，完成相应的建表和查表程序。2． 不限定Trie树的层次。每个叶子结点只含一个关键字，采用单字符逐层分割的策略，实现Trie树的插入、删除和查询的算法，查询可以有两种方法：查询一个完整的单词或者实现以某几个字母开头的单词。-1. Trie index tree as a tree, this structure changed greatly for the size of keywords is particularly useful. Trie tree realize the use of an English word auxiliary memory system to complete the appropriate procedures to build tables and look-up table. 2. Trie is not limited to the level of the tree. Each leaf node contains only one keyword, a single-character layer by layer segmentation strategy, realize Trie tree insert, delete and query algorithms, there are two methods of inquiry: inquiry or a complete word in order to realize a number of letters at the beginning of words.
Platform: |
Size: 972800 |
Author: 蒋笑语 |
Hits:
Description: Trie树既可用于一般的字典搜索，也可用于索引查找。对于给定的一个字符串a1,a2,a3,...,an.则采用TRIE树搜索经过n次搜索即可完成一次查找。不过好像还是没有B树的搜索效率高，B树搜索算法复杂度为logt(n+1/2).当t趋向大，搜索效率变得高效。怪不得DB2的访问内存设置为虚拟内存的一个PAGE大小，而且帧切换频率降低，无需经常的PAGE切换。-Trie tree can be used for general dictionary english, can also be used to search the index. For a given a string a1, a2, a3 ,..., an. Is used TRIE tree english english after n times to complete a search. But they did not like B-tree search efficiency, B tree search algorithm complexity is logt (n+ 1/2). When t trend, and search efficiency becomes efficient. No wonder the DB2 access memory settings for the virtual memory size of a PAGE, and the frame switching frequency to reduce the need for frequent switching PAGE.
Platform: |
Size: 1024 |
Author: ruikobe |
Hits:
Description: lc-trie 路由查找算法， lc-trie 路由查找算法-lc-trie routing search algorithm, lc-trie Routing Lookup Algorithm
Platform: |
Size: 1223680 |
Author: 陈涛 |
Hits:
Description: Trie数据结构，一种字符串存储方式，可以提高字符串的查找效率-a data structure of Trie, which can be used for storing the strings and improve the searching efficiency for a given string
Platform: |
Size: 324608 |
Author: 黄异 |
Hits:
Description: poj3283的代码，是学习Trie的好材料～-poj3283 code is studying the well Trie Materials ~
Platform: |
Size: 1024 |
Author: 诗苇 |
Hits:
Description: This program implements a (zipped) tree search for information retrieval programs, first you can get a key words and then it will save them in its format. also with a simple change you can pass a file as input and find related document information. it implements like big engine searches trie.
Platform: |
Size: 35840 |
Author: saeed |
Hits:
Description: trie字典树 字典树C语言实现的算法。-trie dictionary tree C language implementation of the algorithm.
Platform: |
Size: 1024 |
Author: rosa |
Hits:
Description: trie树的一个实现 trie树是在字符串匹配中常用的一种高效数据结构-trie tree trie tree is a realization of the string matching used in an efficient data structure
Platform: |
Size: 515072 |
Author: 袁梦 |
Hits:
Description: trie 树
什么是 trie 树 ？
◇ trie 树是一种用于快速检索的多叉树结构。
◇ 和二叉查找树不同，在 trie 树中，每个结点上并非存
储一个元素。
◇ trie 树把要查找的关键词看作一个字符序列。并根据
构成关键词字符的先后顺序构造用于检索的树结构。
◇ 在 trie 树上进行检索类似于查阅英语词典。
一棵 m 度的 trie 树或者为空，或者由 m 棵 m 度的 trie 树构
成。-data structure
Platform: |
Size: 247808 |
Author: liang |
Hits:
Description: A implementation of Trie
Platform: |
Size: 1024 |
Author: pfelipe
|
Hits: