Subtree

  • 网络子树
SubtreeSubtree
  1. A Connection and Combination Based Research for Subtree Mining

    基于连接和合并的子树挖掘算法研究

  2. Frequent embedded subtree mining algorithm based on discrete interval

    基于离散区间的频繁嵌入式子树挖掘算法

  3. Changing the newsgroup subtree could result in lost news content

    更改新闻组子目录树会导致新闻内容丢失

  4. The location contains the current subtree and the path to the root .

    该位置包含当前子树和通往根的路径。

  5. Using Orientation Wavelet Fractal Subtree Quantization for Image Coding

    图象小波-分形变换方向子树量化编码

  6. Notice that the element includes child elements that form a subtree structure under the element .

    其中,元素还有自己的孩子,形成了元素下的子树结构。

  7. An algorithm for search of minimal subtree graphs based on multicast routing graphs

    一种基于多播路由图的最小子树图搜索算法

  8. Querying in Sensor Networks Based on Common Subtree Caching

    基于公共子树缓存的传感器网络查询技术研究

  9. The replication for this subtree should look like this

    这个子树的复制拓扑应该像下面这样

  10. The newsgroup subtree is already assigned to another virtual directory .

    新闻组子目录树已分配给其他虚拟目录。

  11. In this paper , we introduce the idea about Orientation Wavelet Subtree Quantization for the first time .

    首次提出了小波方向子树量化的概念,并通过对标准图象内在相关性的统计分析得出了自然图象具有方向自仿射性的结论。

  12. This method , also found on the Document interface , effectively moves a subtree from one document to another .

    在Document接口中也可以找到这个方法,adoptNode方法可以高效地将子树从一个文档移到另一个文档中。

  13. In this article , we specify only one subtree for the configured LDAP server .

    在本文中,我们只为已配置的LDAP服务器指定一个子树。

  14. Frequent Subtree Mining Based on Projected Branch

    基于投影分支的快速频繁子树挖掘算法

  15. Collect all columns used in a subtree .

    集合一个子树中使用的所有列。

  16. Copies the tree node and the entire subtree rooted at this tree node .

    复制树节点和以此树节点为根的整个子树。

  17. Calling the function on a subtree of the document can diminish the risks .

    在文档的子树上调用该函数可以减少这些出错的风险。

  18. Permissions are insufficient to access tree or subtree .

    没有足够的权限访问树或子树。

  19. Among these three categories a possible common subtree algorithm is presented based on the enumeration tree technique of data mining domain .

    本文深入探讨了每类算法中的代表算法,其中根据数据挖掘中枚举树相关技术提出了一种可能的公共子树查找算法的思想。

  20. The transaction state of a registry subtree is incompatible with the requested operation . application for registration

    注册表子树的事务处理状态与请求状态不一致。申请注册,申请登记

  21. They expect to work with an entire document , or at least an entire subtree of a document .

    它们希望处理整个文档,或者至少是文档中一个完整的子树。

  22. To delete an entire subtree in the directory .

    结合使用可删除目录中的整个子树。

  23. The destination node may be in another document , in which case the subtree is copied between documents .

    目标节点可以在另一个文档中,在这种情况下,在两个文档之间复制子树。

  24. If you want additional subtrees configured , add additional base entries with appropriate subtree roots .

    如果您希望配置其他子树,可以在适当的子树根中添加其他基本项。

  25. Sometimes you actually want to sign or compare a subtree of an XML document , rather than the whole thing .

    有时候真正需要的可能是签署或比较XML文档的一个子树,而不是全部内容。

  26. When evaluating the reliability of static subtree , it 's converted into BDD to be analyzed .

    对静态子树进行可靠性分析时,提出将静态子树转化为BDD进行分析。

  27. All the AIX data is present under the cn = aixdata subtree .

    所有AIX数据出现在cn=aixdata子树下面。

  28. The model searching method is brought forward to divide the whole fault tree into unattached static subtree and dynamic subtree .

    提出采用模块搜索法将动态故障树划分为独立的静态子树和动态子树,分别进行分析。

  29. The transaction state of a registry subtree is incompatible with therequested operation .

    注册表子树的事务状态与所请求的操作不兼容。

  30. We propose three algorithms to find the best basis subtree of one temporal frame and optimal Lagrange multiplier of one GOP .

    论文中提出3个优化算法用于确定时域帧的最佳分解结构,并为帧组计算最优的拉格朗日乘子。