TERMIUM Plus^®

Fiche 1,  Justifications,  Anglais

Record number: 1, Textual support number: 1 CONT

A discrimination tree(DT) is a binary classification tree used by the learner to store the information gathered from the teacher.  2, fiche 1, Anglais, - discrimination%20tree

Record number: 1, Textual support number: 1 PHR

decorated discrimination tree  2, fiche 1, Anglais, - discrimination%20tree

Fiche 1,  Justifications,  Français

Fiche 1,  Justifications,  Espagnol

Fiche 2,  Justifications,  Anglais

Record number: 2, Textual support number: 1 CONT

A recursive neural network architecture is composed of a shared-weight matrix and a binary tree structure that allows the recursive network to learn varying sequences of words or parts of an image.... Recursive neural networks use a variation of backpropagation called backpropagation through structure(BPTS).  2, fiche 2, Anglais, - backpropagation%20through%20structure

Fiche 2,  Justifications,  Français

Fiche 2,  Justifications,  Espagnol

Fiche 3,  Justifications,  Anglais

Record number: 3, Textual support number: 1 DEF

... a specific type of tree data structure in which each node has at most two sub-trees, one left and one right.  2, fiche 3, Anglais, - binary%20tree

Record number: 3, Textual support number: 1 CONT

Binary trees are often used for sorting information; each node of the binary search tree contains a key, with values less than that key added to one subtree and values greater than that key added to the other.  2, fiche 3, Anglais, - binary%20tree

Fiche 3,  Justifications,  Français

Record number: 3, Textual support number: 1 CONT

Dans un arbre binaire, chaque élément possède au plus deux éléments fils au niveau inférieur, habituellement appelés gauche et droit.  2, fiche 3, Français, - arbre%20binaire

Fiche 3,  Justifications,  Espagnol

Fiche 4,  Justifications,  Anglais

Record number: 4, Textual support number: 1 DEF

The process of visiting every node in a binary search tree.  2, fiche 4, Anglais, - traversal

Fiche 4,  Justifications,  Français

Fiche 4,  Justifications,  Espagnol

Fiche 5,  Justifications,  Anglais

Record number: 5, Textual support number: 1 DEF

In a binary tree, the root of the tree has level 0 and the level of any other node in the tree is one more that the level of its parent.  1, fiche 5, Anglais, - node%20level

Fiche 5,  Justifications,  Français

Fiche 5,  Justifications,  Espagnol

Fiche 7,  Justifications,  Anglais

Record number: 7, Textual support number: 1 CONT

Tree structures such as the region quadtree... enable the dynamic and hierarchical partitioning of a(raster) data space as opposed to the static partitioning provided by the previous concepts. Most documented applications of region quadtrees on raster data(e. g.(Worboys, 1995),(Samet, 1990)) use the quadtree structure for encoding the raster data down to the level of individual raster cells or pixels. In this approach simple attribute values(e. g. colour values) are assigned to individual leaf nodes. Instead of simple values, leaf nodes could also hold pointers to more complex information, such as binary data strings. This approach allows the region quadtree to be used as the basis for a dynamic variable-size tiling approach. The criteria determining the depth of the quadtree could either be the spatial dimensions of the smallest tile or the maximum amount of data to be stored for an individual tile.  3, fiche 7, Anglais, - quadtree%20structure

Record number: 7, Textual support number: 1 OBS

quadtree structure: term officially approved by the RADARSAT-2 Terminology Approval Group (RTAG).  4, fiche 7, Anglais, - quadtree%20structure

Fiche 7,  Justifications,  Français

Record number: 7, Textual support number: 1 OBS

Structure en mosaïque caractérisée par l'utilisation de cellules carrées, et dans laquelle chacune de ces cellules peut à son tour être subdivisée en quatre cellules de même forme, jusqu'à ce que chaque cellule représente une zone homogène, ou jusqu'à ce que la limite de résolution de l'appareil de mesure ou du système de gestion de base de données à référence spatiale soit atteinte.  2, fiche 7, Français, - structure%20en%20quadrants%20arborescents

Record number: 7, Textual support number: 2 OBS

structure en quadrants arborescents : terme uniformisé par le Groupe de travail de la terminologie de RADARSAT-2 (GTTR).  3, fiche 7, Français, - structure%20en%20quadrants%20arborescents

Fiche 7,  Justifications,  Espagnol

Fiche 8,  Justifications,  Anglais

Record number: 8, Textual support number: 1 DEF

To skip past the first item from a list of things.  1, fiche 8, Anglais, - cdr

Record number: 8, Textual support number: 1 CONT

"Shall we cdr down the agenda?" Silly.  1, fiche 8, Anglais, - cdr

Record number: 8, Textual support number: 1 OBS

Generalized from the LISP operation on binary tree structures, which returns a list consisting of all but the first element of its argument.  1, fiche 8, Anglais, - cdr

Record number: 8, Textual support number: 2 OBS

In the form cdr down, to trace down a list of elements.  1, fiche 8, Anglais, - cdr

Fiche 8,  Justifications,  Français

Record number: 8, Textual support number: 1 DEF

Sauter le premier article d'une liste.  1, fiche 8, Français, - consulter

Record number: 8, Textual support number: 1 CONT

Pouvons-nous cdr down [consulter] l'agenda?  1, fiche 8, Français, - consulter

Record number: 8, Textual support number: 1 OBS

Généralisation d'une opération en LISP sur les structures arborescentes binaire. Cette opération renvoie une liste intégrale à l'exception du premier élément de son argument.  1, fiche 8, Français, - consulter

Record number: 8, Textual support number: 2 OBS

Dans la forme cdr down, examiner, consulter une liste d'éléments.  1, fiche 8, Français, - consulter

Fiche 8,  Justifications,  Espagnol

Fiche 9,  Justifications,  Anglais

Record number: 9, Textual support number: 1 DEF

A binary tree that has no fixed upper limit to the number of nodes it may have.  1, fiche 9, Anglais, - unbounded%20binary%20tree

Fiche 9,  Justifications,  Français

Fiche 9,  Justifications,  Espagnol

Fiche 10,  Justifications,  Anglais

Record number: 10, Textual support number: 1 DEF

A binary tree that has a fixed upper limit to the number of nodes it may have.  1, fiche 10, Anglais, - bounded%20binary%20tree

Fiche 10,  Justifications,  Français

Fiche 10,  Justifications,  Espagnol

Fiche 11,  Justifications,  Anglais

Record number: 11, Textual support number: 1 DEF

A binary tree in which nodes either have two sons or no sons.  1, fiche 11, Anglais, - AVL%20%2D%20tree

Fiche 11,  Justifications,  Français

Fiche 11,  Justifications,  Espagnol