inglês

alemão árabe catalão checo chinês coreano dinamarquês eslovaco espanhol farsi francês grego hebraico hindi húngaro inglês italiano japonês neerlandês polonês português romeno russo sueco tailandês turco ucraniano vietnamita

chinês

Definição alemão árabe catalão checo chinês coreano dinamarquês eslovaco espanhol farsi francês grego hebraico hindi húngaro inglês italiano japonês neerlandês polonês português romeno russo sueco tailandês turco ucraniano vietnamita

Favoritos

node to leaf

Exemplos para "node to leaf"

Não foi possível encontrar esta entrada. Mostrando resultados aproximados. Verifique a ortografia ou proponha a adição deste termo ao dicionário.

node

节点结点淋巴结点節點

leaf

叶子叶片叶树叶茶叶

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.

例如，在平衡树索引遍历过程中从根节点到叶节点搜索节点，但是，发生索引分裂时，分裂可能会从叶节点扩散到父节点，造成锁死。

Outros resultados

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.

决策图［编辑］在决策树中，从根节点到叶节点的路径采用汇合或与。

The s-value of a node is the distance from that node to the nearest leaf of the extended binary representation of the tree.

只需要计算这两个情况的路径距离，并取其大者，就是该二叉树的最大距离。

In the B+ tree, copies of the keys are stored in the internal nodes; the keys and records are stored in leaves; in addition, a leaf node may include a pointer to the next leaf node to speed sequential access.

在Ｂ+树，这些键值的拷贝被存储在内部节点；键值和记录存储在叶子节点；另外，一个叶子节点可以包含一个指针，指向另一个叶子节点以加速顺序存取。

S-value [edit] S-values of a leftist tree The s-value (or rank) of a node is the distance from that node to the nearest leaf of the extended binary representation of the tree.

伸展树是一种自调整形式的二叉查找树，它会沿着从某个节点到树根之间的路径，通过一系列的旋转把这个节点搬移到树根去。