In this pa per, we propose a new method PTM that designs a new structure called Prefix Tree, which stores all of the informa tion in a highly compact form.
因此,本文提出一种基于前缀树的新算法。
参考来源 - 一种基于前缀树的频繁模式挖掘算法 in C·2,447,543篇论文数据，部分数据来源于NoteExpress
Which search is faster, binary search or using prefix tree?
二进制搜索或者搜索速度更快，使用前缀树吗？
We also describe the principle and possibilities of the all-optical prefix tree adder.
描述了该全光前缀树加法器的原理，说明了其实现的可能性。
The prefix tree adder is useful in compound adder implementation. It is preferred over the ripple carry adder and the carry lookahead adder.
该加法器适用于复合型加法运算，优于脉动进位加法器和超前进位加法器。
应用推荐