Sentence examples for By graphs with from inspiring English sources

In these fields, graph kernels provide a powerful tool which allows to combine the natural encoding of molecules by graphs with usual statistical tools.

For genetic regulatory networks described by graphs with a large number of vertices, and a complex structure of edges, the rate equations describing the evolution in time of concentrations are in general difficult to build, and are critically dependent on the assumptions done about the biological and the chemical interactions involved.

Many new strongly regular graphs are obtained by switching and by constructing graphs with prescribed automorphisms.

By constructing graphs with different vertex degrees, we can vary the rate of corresponding LDPC code matrices.

A new method for computing the node-pair reliability of network systems modeled by random graphs with nodes arranged in sequence is presented.

In this paper, we first establish some pinning synchronization criteria for complex networks modeled by directed graphs with both internal and coupling delays based on an event-triggered mechanism.

Similarly means and standard errors are graphically represented by bar graphs with standard error bars, whereas box and whisker plots are used and display the median (strong central band), interquartile range (box) and range (whiskers) for all corresponding non-parametric analyses.

A classic problem from chemistry is used to test a conjecture that in domains for which data are most naturally represented by graphs, theories constructed with inductive logic programming (ILP) will significantly outperform those using simpler feature-based methods.

The final co-segmentation results are achieved by graph cuts with iteratively updating unary term of the foreground appearance model and background appearance model.

We show that there exist graphs of Cartesian maps, of finite mass, which cannot be approximated weakly as currents by graphs of smooth maps with equibounded area.

For the single-source multicast problems represented by directed acyclic graphs with unit-capacity error-free edges, the class of linear network codes achieves the multicast connection capacity [4].