Gesproken tekst vertalen, offlinefuncties, synoniemen, vervoegingen, educatieve spelletjes
Publiciteit
Registreer gratis: toegang tot meer resultaten en functies
node to leaf nodes
Examples with "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
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.
决策图 ［ 编辑 ］ 在决策树中， 从根节点到叶节点的路径采用汇合或与 。
Internal nodes Internal nodes are all nodes except for leaf nodes and the root node.
内部节点 内部节点是除叶子节点和根节点之外的所有节点。
The tree index data structure includes a directory node having a descendent node and a leaf node without having a descendent node.
树形索引数据结构包括具有后继节点的目录节点和没有后继节点的叶节点。
the following graph shows a selected cluster that contains leaf nodes and a node that is the root of a sub-tree
下图显示了一个选定群集，该群集包含叶节点和一个作为子树的根的节点
Some balanced trees store values only at leaf nodes, and use different kinds of nodes for leaf nodes and internal nodes.
一些平衡树只在叶子节点中存储值，而且叶子节点和内部节点使用不同的结构。
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 SQL Server indexes, an intermediate index node that points to other intermediate nodes or leaf nodes.
SQL Server 索引中指向其他中间节点或叶节点的中间索引节点。
A catalog file is ordered as a B-tree which consists of a header node, leaf node, map node and index node and the allocated block numbers of the files are stored in MDB.
编录文件是有序的作为B-树，由一个头节点，叶节点，节点图和索引节点和文件分配的块号码存储在MDB的。
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+树 类似，从根节点开始，每个非叶子节点包含一系列外接矩形和指向对应子节点的指针，而叶子节点则包含空间对象的外接矩形以及这些空间对象（或者指向它们的指针 ） 。
Ga naar Premium voor toegang tot miljoenen vertaalvoorbeelden, onbeperkt woorden opslaan en leren, zonder advertenties.
Woord & uitdrukking van de dag
Afbeelding van de dag
Suggesties
Resultaten: 869. Exact: 3. Verstreken tijd: 49 ms.
