Sentence examples for defined as an edge from inspiring English sources

Every connection between two nodes is defined as an edge.

Equation 8 is defined as an edge stopping threshold matrix, and it has the same dimension as I e (x, y).

The locally heaviest edge is defined as an edge whose weight is at least as high as the weight of any incident edge.

Here a leaf edge is defined as an edge that connects to a leaf node, which has only one incoming edge and no outgoing edges.

In graph theory, a bridge is defined as an edge whose removal disconnects the graph in two subclusters; removing such bridges allowed us to obtain much more homogeneous and correct families.

Motif sites with a significance level of p < 10−5 and that fell within the promoter region ([−750, 250] base-pairs around the transcriptional start site) of one of the genes measured on our expression arrays were used to defined as an edge between a motif and that gene in our regulatory network prior.

Given a path P, we define a winner as an edge e with the maximal score Score P e) among all extension edges for P. Similarly, a contender is defined as an extension edge with the second best score.

We evaluated network reconstruction performance, using the area under the curve of the precision-recall plot (AUCPR), where precision   =  number of true positives total number of edges detected, recall   = number of true positives total number of true edges, and a true positive was defined as an inferred directed edge that existed in the true network used to generate the expression data.

AUCROC is a composite measure based on true positive rate (recall) and false positive rate, defined as false positive rate   =  number of false positives total number of true absent edges, where a false positive was defined as an inferred directed edge that did not exist in the true network used to generate the expression data.

Generally, RNG is defined as follows: an edge (u, v) exists between devices u and v if the distance d u, v) is less than or equal to the distance between every other device w, and whichever of u and v is farther from w.

More specifically, the proposed method regards the data association among multiple objects as a minimum weight bipartite graph edge, which is defined as a subset of edges such that each vertex is incident on at least one edge and the sum of the weights in the subset of edges is minimum, given an edge weighted graph.