说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 模糊外延trie树
1)  fuzzy extent trie
模糊外延trie树
2)  real concept extent Trie
实概念外延Trie树
3)  fuzzy intent trie
模糊内涵trie树
4)  Trie-tree
Trie树
1.
Study on Chinese-English dictionary lookup mechanism based on combining Trie-tree with inverted index;
Trie树和单字倒排相结合的汉英词典查找机制
2.
A Jumping Table Trie-tree IP Classification Algorithm;
基于跳转表Trie树的IP分类算法
3.
In order to improve lookup efficiency,a novel IP classification,NHMT(non-collision Hash and nultibit-trie tree) is proposed, which is based on non-collision Hash trie-tree algorithm and grid of tries algorithm.
为了提高查找效率,在无冲突哈希查找算法和Grid of Tries算法的基础上提出了一种基于无冲突哈希和多比特Trie树(NHMT)的IP分类算法。
5)  trie tree
Trie树
1.
After analyzing the binary-Trie tree, an algorithm of IP address classification bases on 256-branch search tree is introduced.
在分析二叉Trie树的基础上,改进了其结构,提出了基于256-叉查找树的IP地址分类算法,并详细介绍了其实现过程,比较了它们的优缺点。
2.
We improved the structure of Trie tree,a kind of ordered tree,to build a pinyin tree,and then implement the intelligent Chinese pinyin input under uCLinux.
本文采用改进的Trie树构造拼音生成树,在uClinux上实现了具有联想功能的汉字输入法。
6)  Trie
Trie树
1.
Binary Search on Levels (BSOL) algorithm, which supports range and prefix rules, is a time efficient packet classification algorithm and can extend to multi-dimension packet classification easily while its performance is affected badly when the load factor of hash table is large or hash collision occurs frequently since the key structure is a hash table created by Trie tree in every layer.
改进后的折半层次搜索算法将为Trie树的每一层建立了一个布鲁姆过滤器,在进行hash查找之前先进行一次布鲁姆查询运算,能够保障在hash装载因子较大的情况下依然具有良好的性能。
补充资料:海南龙血树(小花龙血树)
DracaenacambodianaPierreexGagnep.

百合科Liliaceae

乔木状,高3-4m。叶聚生于茎和枝顶,几呈套叠状,长约70cm,抱茎,无柄。圆锥花序长约30cm,花序轴无毛或近无毛。分布于海南西南部,生于背风区的干燥砂土上。越南、柬埔寨也有分布。国家三级保护濒危种。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条