「sub-tree」の共起表現一覧(1語右で並び替え)
該当件数 : 22件
| If the root of the second-to-last | subtree has a left child, swap it to be the right chi |
| bel each access X1 L if key X1 is in y's left | subtree in P, R if key X1 is in y's right subtree in |
| ee T such that every hyperedge of H induces a | subtree in T. |
| When a | subtree is rotated, the subtree side upon which it is |
| If the right | subtree needs more registers than the left subtree, t |
| balance the tree; specifically when the right | subtree of node X has a significantly (depends on the |
| umber of registers needed to compute the left | subtree of node n is bigger than the number of regist |
| All strings in the middle | subtree of a node start with that prefix. |
| A wid is relative to the key of a | subtree or leaf, but specifies a range of addresses c |
| the balance factor of P is -2 then the right | subtree outweights the left subtree of the given node |
| metadata, such as the range of values in the | subtree rooted at that node. |
| ctively reachable from v by travelling in the | subtree rooted at v, along with at most one non-tree |
| rpreted as follows: the sum of weights in any | subtree should be no greater than c. |
| In the latter case, we delete y from the | subtree that contains it. |
| By changing the dsp at the top of a | subtree, the keys of all the data underneath are impl |
| wn to an integer number of nodes) to the left | subtree, the next node to the root, and the remaining |
| Subtree Transformational Grammar | |
| A cluster is a connected | subtree with at most two . |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
