Results 21 to 30 of about 704,956 (316)
Graph-Informed Neural Networks for Regressions on Graph-Structured Data
In this work, we extend the formulation of the spatial-based graph convolutional networks with a new architecture, called the graph-informed neural network (GINN).
Stefano Berrone +4 more
doaj +1 more source
Permutation Tests for Infection Graphs [PDF]
70 pages, 15 figures, 2 ...
Justin Khim, Po-Ling Loh
openaire +2 more sources
A Method for Testing Graph Visualizations Using Games [PDF]
We describe a system that enables us to perform exploratory empirical experiments with graph visualization techniques by incorporating them into games that can be played on an internet site, the Graph Games Website (http://www.cs.kent.ac.uk/projects ...
Bovey, John D., Rodgers, Peter
core +1 more source
This research was a descriptive case study. The purpose of this research was to describe the student’s ability to interpret the kinematics graph. The subjects of the study were 347 students of class XI science in the even semester of 2018/2019 in Luwu ...
B. D. Amin +5 more
doaj +1 more source
Adjacency Maps and Efficient Graph Algorithms
Graph algorithms that test adjacencies are usually implemented with an adjacency-matrix representation because the adjacency test takes constant time with adjacency matrices, but it takes linear time in the degree of the vertices with adjacency lists. In
Gabriel Valiente
doaj +1 more source
CONTEST : a Controllable Test Matrix Toolbox for MATLAB [PDF]
Large, sparse networks that describe complex interactions are a common feature across a number of disciplines, giving rise to many challenging matrix computational tasks.
Alan Taylor +6 more
core +1 more source
A combined tree growing technique for block-test scheduling under power constraints [PDF]
A tree growing technique is used here together with classical scheduling algorithms in order to improve the test concurrency having assigned power dissipation limits.
Wang, Xiaojun +6 more
core +1 more source
Non-Deterministic Graph Property Testing [PDF]
A property of finite graphs is called non-deterministically testable if it has a ‘certificate’ such that once the certificate is specified, its correctness can be verified by random local testing. In this paper we study certificates that consist of one or more unary and/or binary relations on the nodes, in the case of dense graphs.
L. Lovxe1sz, K. Vesztergombi
openaire +3 more sources
Reproducibility of graph metrics in fMRI networks
The reliability of graph metrics calculated in network analysis is essential to the interpretation of complex network organization. These graph metrics are used to deduce the small-world properties in networks.
Qawi K Telesford +8 more
doaj +1 more source
Reproducibility of functional connectivity and graph measures based on the Phase Lag Index (PLI) and weighted Phase Lag Index (wPLI) derived from high resolution EEG [PDF]
Functional connectivity (FC) and graph measures provide powerful means to analyze complex networks. The current study determines the inter-subject-variability using the coefficient of variation (CoV) and long-term test-retest-reliability (TRT) using the ...
Florian Hatz +23 more
core +1 more source

