Gesproken tekst vertalen, offlinefuncties, synoniemen, vervoegingen, educatieve spelletjes
Publiciteit
Registreer gratis: toegang tot meer resultaten en functies
root node to leaf nodes
Examples with "root node to leaf nodes" and their translation in Chinees
The node searching method then includes a process of searching descendent nodes to perform a traversing from a root node to leaf nodes according to a tree index data structure (S320).
节点搜索方法还包括搜索后继节点，以根据树形索引数据结构从根节点到叶节点进行遍历的过程（S320）。
The present disclosure relates to a node search using a tree index; and, more particularly, to a method and apparatus for searching nodes by traversing the nodes from a root node to leaf nodes according to a tree index data structure.
本发明涉及一种使用树形索引的节点搜索，特别涉及一种根据树形索引数据结构从根节点到叶节点遍历节点的节点搜索方法和装置。
For example, nodes are searched from a root node to leaf nodes in a process of traversing a B-tree index, whereas, when an index split occurs, the split may spread from a leaf node to a parent node, resulting in a dead lock.
例如，在平衡树索引遍历过程中从根节点到叶节点搜索节点，但是，发生索引分裂时，分裂可能会从叶节点扩散到父节点，造成锁死。
Andere resultaten
This depth will increase slowly as elements are added to the tree, but an increase in the overall depth is infrequent, and results in all leaf nodes being one more node farther away from the root.
深度在元素添加至树的过程中缓慢增长，而整体深度极少地增长，并导致所有叶子节点与根节点距离加1。
Hierarchical softmax uses a binary tree and constructs the loss function based on the path from the root node to the leaf node. The gradient computational overhead for each step in the training process is related to the logarithm of the dictionary size.
层序 softmax 使用了二叉树，并根据根节点到叶子节点的路径来构造损失函数。其训练中每一步的梯度计算开销与词典大小的对数相关。
In a decision tree, all paths from the root node to the leaf node proceed by way of conjunction, or AND.
决策图 ［ 编辑 ］ 在决策树中， 从根节点到叶节点的路径采用汇合或与 。
You cannot configure a leaf node as the master node because it does not have direct access to all the nodes other than its non-root server.
不能将叶子节点配置成主节点，因为它不能直接访问其非根服务器之外的所有其他节点。
Searching is quite similar to searching in a B+ tree. The search starts from the root node of the tree. Every internal node contains a set of rectangles and pointers to the corresponding child node and every leaf node contains the rectangles of spatial objects (the pointer to some spatial object can be there).
搜索算法和B+树 类似，从根节点开始，每个非叶子节点包含一系列外接矩形和指向对应子节点的指针，而叶子节点则包含空间对象的外接矩形以及这些空间对象（或者指向它们的指针 ） 。
Since each node stores the intervals that overlap it, with all intervals completely to the left of its center point in the left subtree, similarly for the right subtree, it follows that each interval is stored in the node closest to the root from the set of nodes whose center point it overlaps. Normal deletion operations in a binary tree (for the case where the node being deleted has two children) involve promoting a node further from the leaf to the position of the node being deleted (usually the leftmost child of the right subtree, or the rightmost child of the left subtree). Deleting a node with two children from a binary search tree using the in-order predecessor (rightmost node in the left subtree, labelled 6).
其中每个节点都可以有两个固定位置的子树的有根树叫做二叉树 ，二叉树中每个节点的两个子树分别叫做左子树 和右子树 ，由于位置固定，没有左子树的时候也是可以有右子树的。 而"多叉树"通常并不指n为任意值的n叉树，只是在和n叉树作比较的时候表示普通的有根树。 对于随机的树，高度的平均复杂度是O（logn ） ， 但是没有限制而且不随机的树高度也可以达到O（n ） ， 也就是除了叶节点都只有一个子树，或者常数个分支的情况。
Internal nodes Internal nodes are all nodes except for leaf nodes and the root node.
内部节点 内部节点是除叶子节点和根节点之外的所有节点。
the following graph shows a selected cluster that contains leaf nodes and a node that is the root of a sub-tree
下图显示了一个选定群集，该群集包含叶节点和一个作为子树的根的节点
Each round of Monte Carlo tree search consists of four steps: Selection: start from root R and select successive child nodes until a leaf node L is reached.
蒙特卡洛树搜索的每个循环包括四个步骤： 选择（Selection）：从根節点R开始，选择连续的子節点向下至叶子節点L。
In this kind of scenario, the consolidation management structure need only use the parent Group as the root node. Other participating Business Units are leaf nodes, as shown in the figure below
在这种业务场景下，合并管理结构只需将母集团作为根节点，其他参与合并的业务单元均是叶子节点，如下图所示：
Ga naar Premium voor toegang tot miljoenen vertaalvoorbeelden, onbeperkt woorden opslaan en leren, zonder advertenties.
Woord & uitdrukking van de dag
Afbeelding van de dag
Resultaten: 54161. Exact: 3. Verstreken tijd: 44 ms.
