نتایج جستجو برای: graph based
تعداد نتایج: 3070292 فیلتر نتایج به سال:
Let $R$ be a commutative ring with identity and $I$ proper ideal of $R$. In this paper we introduce the ideal-based quasi zero divisor graph $Q\Gamma_{I}(R)$ respect to which is an undirected vertex set $V=\{a\in R\backslash\sqrt{I}:$ $ab\in I$ for some $b\in R\backslash\sqrt{I}\}$ two distinct vertices $a$ $b$ are adjacent if only I$. We study basic properties such as diameter, girth, dominato...
The usage of blockchain technology has been significantly expanded with smart contracts and oracles . While enables to automate the execution an agreement between untrusted parties, oracles provide data external a given blockchain, i.e., off-chain data. However, validity accuracy such can be qu...
This paper describes how the Fujaba CASE tool supports a semi-automatic transformation of usecase scenarios specified by so called story boards into automatic test specifications and test implementations. A story board is a sequence of graph snapshots showing the evolution of a graph based object structure during a typical example execution of an usecase. From such an example execution we autom...
One major drawback of phrase-based translation is that it segments an input sentence into continuous phrases. To support linguistically informed source discontinuity, in this paper we construct graphs which combine bigram and dependency relations and propose a graph-based translation model. The model segments an input graph into connected subgraphs, each of which may cover a discontinuous phras...
Graph-based Semi-Supervised Learning (SSL) aims to transfer the labels of a handful labeled data remaining massive unlabeled via graph. As one most popular graph-based SSL approaches, recently proposed Graph Convolutional Networks (GCNs) have gained remarkable progress by combining sound expressiveness neural networks with graph structure. Nevertheless, existing methods do not directly address ...
Abstract In this paper, the exact formulae for the Harary indices of join, disjunction, symmetric difference, strong product of graphs are obtained. Also, the Schultz and modified Schultz indices of join and strong product of graphs are computed. We apply some of our results to compute the Harary, Schultz and modified Schultz indices of fan graph, wheel graph, open fence and closed fence graphs.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید