Using prefix tree and dynamic programming, this algorithm boosts the speed of Chinese word segmentation and guarantees relatively high precision.
基于前缀树和动态规划，该算法提高了中文分词速度，同时保持了相对较高的分词准确性。
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.
该加法器适用于复合型加法运算，优于脉动进位加法器和超前进位加法器。
It constructs a prefix tree to represent the sequence patterns, and continuously maintains the tree structure by using width pruning and depth pruning.
该算法构造了前缀树表示序列模式，并用广度剪枝和深度剪枝维护该前缀树的结构。
The model can be extended for studying more complex all-optical circuits of enhanced functionality in which the prefix tree adder is the basic building block.
提出的模型可扩展，用于研究以全光前缀树加法器为基本构造模块的功能强大的复杂全光回路。
We propose and describe an all-optical prefix tree adder with the help of a terahertz optical asymmetric demultiplexer (TOAD) using a set of optical switches.
提出一种基于太赫兹光学非对称解复用器的全光前缀树加法器，在其中使用了多个光开关。
This paper proposes a fast algorithm DMFP and an updating algorithm IUMFP, which are based on Prefix Tree for mining maximum frequent patterns.
因此，文章提出了一种最大频繁模式的快速挖掘算法DMFP及更新算法IUMFP。
This paper proposes a fast algorithm DMFP and an updating algorithm IUMFP, which are based on Prefix Tree for mining maximum frequent patterns.
因此，文章提出了一种最大频繁模式的快速挖掘算法DMFP及更新算法IUMFP。
应用推荐