二进制搜索或者搜索速度更快，使用前缀树吗？
描述了该全光前缀树加法器的原理，说明了其实现的可能性。
We also describe the principle and possibilities of the all-optical prefix tree adder.
特别对多种前缀树型结构进行了分析比较，分析了各自的特点以及内存占用情况。
Especially, we analyzed many kinds of prefix-trees structures, has compared the characteristic and the usage of memory of each other.
该算法构造了前缀树表示序列模式，并用广度剪枝和深度剪枝维护该前缀树的结构。
It constructs a prefix tree to represent the sequence patterns, and continuously maintains the tree structure by using width pruning and depth pruning.
基于前缀树和动态规划，该算法提高了中文分词速度，同时保持了相对较高的分词准确性。
Using prefix tree and dynamic programming, this algorithm boosts the speed of Chinese word segmentation and guarantees relatively high precision.
提出一种基于太赫兹光学非对称解复用器的全光前缀树加法器，在其中使用了多个光开关。
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 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.
当采用识别名称空间的方式时，以逻辑树的XMLNS域中的字段为前缀。
When operating in a namespace aware manner, fields in the XMLNS domain of the logical tree are prefixed.
前缀数字用于帮助识别包树中的特定的包。
The prefix Numbers help identify the particular package in the tree of packages.
树本身是按照前缀顺序将调试信息扁平化的一种表示方法。
The tree itself is represented by flattening it in prefix order.
语言学家把一个语义单位称作一个词素，如“tree(树)”，或“un-(前缀“否”)”。一些语言将词素结合在一起。
Linguists call a single unit of meaning, whether "tree" or "UN -", a morpheme, and some languages bind them together obligatorily.
并给出真前缀标记树的一种GUI表现方式。
A representation form for marked proper-prefixed tree in GUI is given.
并给出真前缀标记树的一种GUI表现方式。
A representation forms for marked proper-prefixed tree in GUI are given.
本主题介绍在序列化xml树时如何控制命名空间前缀。
This topic describes how you can control namespace prefixes when serializing an XML tree.
本文针对前缀路由查询，根据前缀被访问的概率依据字母表树构建了一种基于概率的最优路由查询数据结构。
This paper constructs a data structure to implement optimal looking up by alphabet tree based on probabilities of the prefix to be accessed.
采用按值分支树的多维综合流分类算法支持前缀和范围匹配，可扩展性强，适合大容量规则数据库。
The compositive multi-dimensional packet classification algorithm based on tree divided by value is scalable. It can deal with prefixes match and range match for large rule sets.
然后在构造xml树时，在元素和属性名称中使用该前缀。
You then use the prefix in the element and attribute names when you construct the XML tree.
除此之外，算法对频繁模式树中每个节点增加一个位串来存储该项目的前缀项目，以避免在模式扩展的时候频繁的遍历子树。
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.
除此之外，算法对频繁模式树中每个节点增加一个位串来存储该项目的前缀项目，以避免在模式扩展的时候频繁的遍历子树。
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.
应用推荐