Results 11 to 20 of about 453,973 (330)
buTCS: An Optimized Algorithm for Estimating the Size of Transitive Closure [PDF]
IEEE Access, 2021 Given a directed graph and a node $v$ , the transitive closure (TC) of $v$ is the set of nodes that $v$ can reach in the graph. TC size is very important in many applications but the cost of TC size computation is high in both time and space, which ...
Xiaozhe Li +3 more
doaj +2 more sources
TRACT: Denoising Diffusion Models with Transitive Closure Time-Distillation [PDF]
arXiv.org, 2023 Denoising Diffusion models have demonstrated their proficiency for generative sampling. However, generating good samples often requires many iterations.
David Berthelot +8 more
openalex +3 more sources
Transitive Closures of Ternary Fuzzy Relations [PDF]
International Journal of Computational Intelligence Systems, 2021 Recently, we have introduced six types of composition of ternary fuzzy relations. These compositions are close in spirit to the composition of binary fuzzy relations.
Lemnaouar Zedam, Bernard De Baets
doaj +3 more sources
AxiomsA randomly generated fuzzy matrix refers to a fuzzy matrix in which the values of elements belong to the sample space of a [0,1]-random variable that follows a certain probability distribution.
Nan Li, Xianfeng Yu, Wuniu Liu
doaj +2 more sources
Transitive closure and transitive reduction in bidirected graphs [PDF]
Czechoslovak Mathematical Journal, 2019 In a bidirected graph an edge has a direction at each end, so bidirected graphs generalize directed graphs. We generalize the definitions of transitive closure and transitive reduction from directed graphs to bidirected graphs by introducing new notions of bipath and bicircuit that generalize directed paths and cycles.
Ouahiba Bessouf +2 more
openalex +4 more sources
Speeding Up Floyd–Warshall’s Algorithm to Compute All-Pairs Shortest Paths and the Transitive Closure of a Graph [PDF]
AlgorithmsFloyd–Warshall’s algorithm is a widely-known procedure for computing all-pairs shortest paths in a graph of n vertices in Θ(n3) time complexity. A simplified version of the same algorithm computes the transitive closure of the graph with the same time ...
Giuseppe Lancia, Marcello Dalpasso
doaj +2 more sources
Parallel Transitive Closure Algorithm for Heterogeneous Architecture [PDF]
Jisuanji gongcheng, 2021 The traditional method for obtaining the transitive closure of the graphs faces the large amount of calculation and long calculation time. In order to improve the computing speed of the transitive closure algorithm for dealing with large amounts of data,
XIAO Han, GUO Baoyun, LI Cailin, ZHOU Qinglei
doaj +1 more source
Extending Full Transitive Closure to Rank Removable Edges in GN Algorithm
, 2016 R. Gayathri +2 more
openalex +2 more sources
Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent [PDF]
Annual Conference for Computer Science Logic, 2018 Liron Cohen, Reuben N. S. Rowe
openalex +2 more sources
Reconstruction Method of Ocean Front Model Based on Fuzzy Cluster Analysis of Sound Speed Profile
IEEE Access, 2021 Ocean fronts are mostly determined according to the horizontal temperature gradient, and various selection criteria may lead to different frontal zones. This study proposes a frontal zone delineation method based on sound speed profile.
Yuyao Liu +5 more
doaj +1 more source