subtrees
英
美
网络 子树
双语例句
- For this scenario, click the Subtrees button to recursively compare the two complete configurations.
对于此场景，请单击Subtrees按钮，从而以递归方式比较两个完整配置。 - You can think of levels in a FOT index as smaller subtrees ( buckets).
您可以将FOT索引中的级视作较小的子树（桶）。 - A dialog box appears with three buttons: Subtrees, Properties, and Cancel.
将会显示包含三个按钮的对话框：Subtrees、Properties和Cancel。 - This subtree, in turn, has other separate subtrees under it that hold the user entries, group entries, and other necessary information.
这个子树包含其他子树，它们包含用户条目、组条目和必需的其他信息。 - Pulldom is built on top of minidom, but can selectively build subtrees.
pulldom构建在minidom之上，但是可以有选择地构建子树。 - If you want additional subtrees configured, add additional base entries with appropriate subtree roots.
如果您希望配置其他子树，可以在适当的子树根中添加其他基本项。 - In some cases, we may actually want to traverse these nodes in the reverse order, skip certain nodes or subtrees, or something else.
在某些情况下，我们实际可能希望按照相反的顺序遍历这些节点、跳过某些节点或子树或其他一些内容。 - Also, the metadata conditions can be easily explored by opening and closing the subtrees without selecting them.
此外，通过打开和关闭子树（没有选中它们），可以很容易地研究元数据条件。 - Use deepcopy when serializing subtrees
在序列化子树时使用deepcopy - Likewise, markup subtrees ( i.e. "emph"," strong"," module"," code"," title") are collapsed to a single node of the right type, and containing a compound string.
同样，标记子树（即“emph”、“strong”、“module”、“code”和“title”）折叠为一个类型正确的单独节点，并包含一个复合字符串。 - We will revisit this topic in the section Creating subtrees.
我们将在创建子树一节中详细讨论这个主题。 - The search bases specified must be subtrees of the base entry in the repository.
指定的搜索基必须是存储库中基本项的子树。 - Clustering GML Documents by Structure Based on Closed Frequent Induced Subtrees
基于闭合频繁Induced子树的GML文档结构聚类 - To which is still unable to complete the parsing, chooses certain widest subtrees compulsion matched and then outputs.
对依然无法完成的分析，选择若干最宽子树强制匹配输出。 - The strongly connected components form the subtrees of the search tree, the roots of which are the roots of the strongly connected components.
强连通分量形成了搜索树，他们的根就是强连通分量的根。 - After multiresolution motion detection, these wavelet subtrees are classified into motion and non-motion subtrees.
对这些小波子树进行运动检测，分成运动树和非运动树两类。 - The main idea of every traditional algorithm for deleting a node from an AVL tree is to delete the node first and then to process certain subtrees from below to above, relating to the backtracking from below to above.
所有传统的删除AVL树的结点的算法的主要思想都是先删除结点再自下而上处理某些子树，涉及自下而上的后退。 - A new algorithm for deleting a node from a red-black tree is presented, whose main idea is to process certain subtrees from above to below first and then to delete the node, without relating to the backtracking from below to above.
提出一种新的删除红黑树的结点的算法，其主要思想是先自上而下处理某些子树再删除结点，不涉及自下而上的后退。 - An Improved Fractal Image Coding Algorithm Based on Oriented Wavelet Subtrees
基于方向性小波子树分形图像编码的改进算法 - The keys of the algorithm are both the generations of candidate subtrees and their frequency counting.
XMLMINER算法的关键问题在于候选子树的列举和支持度计算。 - Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation.
本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。 - The pruning method can permits us to directly get some undiscovered frequent patterns from some discovered frequent patterns, so that deceases quantity of candidate subtrees and time that used to count the frequency of their, thereby improves the efficiency of our algorithm.
根据修剪策略，我们可以直接从某些已知频繁子树中产生某些未知频繁子树，因此减少了算法在候选子树的列举和支持度计算上的开销，从而提高了算法的效率。 - The algorithm makes the fractal matching between subtrees on wavelet domain and the lifting scheme is leaded into wavelet domain by similarity of wavelet subtrees. The algorithm makes use of advantages of WT and fractal. It achieves good result in practice.
该算法在小波域进行图象子树的分形匹配，并利用小波子树的相似性引入提升模式，发挥了小波变换WT和Fractal的优点，在实践中收效良好。 - The operation rules and the transformation steps between model subtrees are described.
论述操作规则和模型结构子树的构建步骤。 - However, as we have discovered in our previous study, because of large size of structured database, the number of frequent subtrees usually grows exponentially with the tree size.
由于结构数据库的海量，频繁子树的数量通常随树的大小指数增长，这种情况在事务间高度相关的数据库中尤为突出，这带来了两个问题：用户需要管理和使用大量的频繁子树； - Our tree similarity algorithm, as part of semantic match-making, computed the similarity of subtrees in a recursive way.
作为语义匹配的一部分，我们的树相似性算法以递归方式计算子树的相似性。 - The new algorithm expresses Web label in the form of tree, defines a special kind of tree. Comparing the entire tree is turned to comparing these particular subtrees. Experiment proves this algorithm has higher degree of differentiation on different Web tag tree.
新算法将网页的标签表示成树的形式，并定义一种特殊的子树，将整个树的比较划为对这些特殊子树的比较，实验证明了此算法能有效反映网页结构的相似程度。 - It could be parameterized by different functions to adjust the similarity of these subtrees.
它可以是不同的功能参数化来调整这些子树的相似性。 - The introduction of shortcuts between the subtrees of the root not only ensures forward message without relying on the root in the process of resources search, but also reduces the average length of the search path.
根子树间短连接的引入，不仅保证了资源搜索过程中的消息转发不依赖于根节点，而且也降低了平均搜索路径长度。 - Based on prefix code, aiming at the root cause of the problem, put forward a better way of coding, while retaining the Dewey characteristics at the same time, in the XML subtrees updating, greatly reduces the coding time.
基于前缀编码，针对根源问题，提出了一套更优的编码方式，在保留前缀编码特点的同时，在XML子树更新上，大幅度降低了编码更新时间。