The tree itself is represented by flattening it in prefix order.
树本身是按照前缀顺序将调试信息扁平化的一种表示方法。
The prefix Numbers help identify the particular package in the tree of packages.
前缀数字用于帮助识别包树中的特定的包。
Which search is faster, binary search or using prefix tree?
二进制搜索或者搜索速度更快，使用前缀树吗？
This paper constructs a data structure to implement optimal looking up by alphabet tree based on probabilities of the prefix to be accessed.
本文针对前缀路由查询，根据前缀被访问的概率依据字母表树构建了一种基于概率的最优路由查询数据结构。
It constructs a prefix tree to represent the sequence patterns, and continuously maintains the tree structure by using width pruning and depth pruning.
该算法构造了前缀树表示序列模式，并用广度剪枝和深度剪枝维护该前缀树的结构。
You then use the prefix in the element and attribute names when you construct the XML tree.
然后在构造xml树时，在元素和属性名称中使用该前缀。
Using prefix tree and dynamic programming, this algorithm boosts the speed of Chinese word segmentation and guarantees relatively high precision.
基于前缀树和动态规划，该算法提高了中文分词速度，同时保持了相对较高的分词准确性。
You also use the prefix when querying an XML tree using XML properties.
此外，在使用XML 属性来查询 XML树状结构时，您也会使用此前置词。
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。
We also describe the principle and possibilities of the all-optical prefix tree adder.
描述了该全光前缀树加法器的原理，说明了其实现的可能性。
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.
提出的模型可扩展，用于研究以全光前缀树加法器为基本构造模块的功能强大的复杂全光回路。
The second set shows how to create an XML tree in a namespace with a prefix, also in both languages.
第二组范例则显示如何同时在这两种语言中建立具有前置词之命名空间的XML树状结构。
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.
提出一种基于太赫兹光学非对称解复用器的全光前缀树加法器，在其中使用了多个光开关。
The following example creates an XML tree that is in a namespace with a prefix.
下列范例会建立位于命名空间中，具有前置词的xml树状结构。
In addition, we add a bit string to each node in the tree to store the prefix of the items. By using the structure we can avoid repeatedly traversing the sub-tree while expanding the patterns.
除此之外，算法对频繁模式树中每个节点增加一个位串来存储该项目的前缀项目，以避免在模式扩展的时候频繁的遍历子树。
The prefix tree adder is useful in compound adder implementation. It is preferred over the ripple carry adder and the carry lookahead adder.
该加法器适用于复合型加法运算，优于脉动进位加法器和超前进位加法器。
The prefix tree adder is useful in compound adder implementation. It is preferred over the ripple carry adder and the carry lookahead adder.
该加法器适用于复合型加法运算，优于脉动进位加法器和超前进位加法器。
应用推荐