Sentence examples for consists of a graph from inspiring English sources

The second map builder stores a hybrid metric-topological representation: the map consists of a graph whose nodes contain local occupancy grid maps and whose edges are labeled with the relative pose between pairs of nodes.

Firstly, a graphical model consists of a graph with dots, lines and potentially arrowheads.

As described in the previous section, each classifier C i consists of a graph structure G i and a set of conditional probability parameters, Θ i, that is: C i =(G i, Θ i ).

The resulting data structure consists of a graph, where each node is a contiguous multiple alignment, undirected edges exist between the 5' and 3' ends of the contig nodes, and reads form alignments along paths of the graph.

The proposed method consists of a graph-based representation of the physical process and a heuristic algorithm which generates network designs with a minimum number of segments that satisfy a set of conditions provided by a human expert.

It consists of a line graph template, on which users can enter data, labels for the axes, and a title.

A cognitive model (CM) of the decision problem consists of a directed graph that comprises factors, and connections between the factors.

Each figure consists of a geometric graph (sizes are in mm), images captured by a camera installed outside the experimental pipe, and 2D velocity vectors measured by the PIV.

The instance consists of a directed graph G="(V,E) with edge-weight w e) (the power needed to transmit a message along e) for every e∈E, node capacity b v) (the battery charge of v) for every v∈V, and a root r.

This manually curated data set consists of a directed graph with 1,634 elements (nodes) connected by 5,089 interactions (arcs), of which 2,403 are activatory, 741 are inhibitory, 1,915 are undirected, and 30 are unspecified.

The group Steiner tree problem consists of, given a graph G, a collection R of subsets of V(G) and a cost c e) for each edge of G, finding a minimum-cost subtree that connects at least one vertex from each R∈R.