Sentence examples for matching is defined from inspiring English sources

Nearest-neighbour matching is defined by: C i =underset{j}{ min}leftVert {p}_iright.-{p}_jleftVert, right.

The weight of the k-clique matching is defined as the sum of the weights of all its k-cliques.

The matching is defined on exact string equivalence.

The cost of this matching is defined to be the sum of the half-breakpoint parsimony cost of all vertices (half-breakpoints).

The degree of match is determined by the minimal distance between concepts in the taxonomy tree and four degrees of matching are defined.

Matching was defined as 10/10 fully matched.

Donor and recipient HLA matching were defined using best available HLA-matching data.

Literacy skill match is defined following Pellizzari and Fichen (2013).

The match is defined according to the subgraph isomorphism (formally defined in Definition 13).

A match is defined as a pixel value within 2.5 standard deviation of a distribution.

The join result of two joinable local partial matches is defined as follows.