用acyclic graph造句子，“acyclic graph”造句

Directed acyclic graph support vector (DAG - SVMS) multi - category classification methods, is a new multi - category classification methods.

To solve the difficulty in modeling a chemical system a new node granularity transformation method based on object directed acyclic graph was proposed.

A constructible definition of the directed acyclic graph was described, and the reason why exists a solution that does not exceed the total execution time of all tasks was explained.

Is it practical to store unique paths through a directed acyclic graph?

A product type hierarchy is a strict tree, whereas a category hierarchy can be a directed acyclic graph.

In this paper, we use directed-acyclic graph (DAG) to represent a query processing, then define a cost model and a query efficiency model, and finally put forward an algorithm for materialized views selection.

Algorithm to find a hierarchy tree in a directed acyclic graph?

The support vector machine composed by least sequence and directed acyclic graph algorithm has been used in paper currency identification, shows the advantages of capability in dealing with scared samples, nonlinear and high dimensions.

A topological sort is carried out on a directed graph with no cycles. Such a graph is called a directed, acyclic graph, often abbreviated DAG.

A Dryad job is a graph generator which can synthesize any directed acyclic graph.

The set of jobs is specified using a directed acyclic graph, where each job is a node in the graph. Jobs are submitted to Condor following the dependencies given by the graph.

G is a maximal acyclic graph.