Results 51 to 60 of about 3,672,970 (235)
On the Fractionalization of the Shift Operator on Graphs
The theory of graph signal processing has been established with the purpose of generalizing tools from classical digital signal processing to the cases where the signal domain can be modeled by an arbitrary graph.
Guilherme B. Ribeiro +2 more
doaj +1 more source
Bounds for the energy of a complex unit gain graph [PDF]
A $\mathbb{T}$-gain graph, $ = (G, )$, is a graph in which the function $ $ assigns a unit complex number to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency matrix $ A( ) $ is defined canonically.
Aniruddha Samanta, M. Rajesh Kannan
openaire +3 more sources
A dual‐modal graph attention interaction network for person Re‐identification
Person Re‐identification (Re‐ID) is a task of matching target pedestrians under cross‐camera surveillance. Learning discriminative feature representations is the main issue for person Re‐ID.
Wen Wang, Gaoyun An, Qiuqi Ruan
doaj +1 more source
Multi-Robot Collaborative Perception With Graph Neural Networks [PDF]
Multi-robot systems such as swarms of aerial robots are naturally suited to offer additional flexibility, resilience, and robustness in several tasks compared to a single robot by enabling cooperation among the agents.
Yang Zhou +3 more
semanticscholar +1 more source
Effective Seed Scheduling for Fuzzing with Graph Centrality Analysis [PDF]
Seed scheduling, the order in which seeds are selected, can greatly affect the performance of a fuzzer. Existing approaches schedule seeds based on their historical mutation data, but ignore the structure of the underlying Control Flow Graph (CFG ...
Dongdong She, Abhishek Shah, S. Jana
semanticscholar +1 more source
Spiking Graph Convolutional Networks [PDF]
Graph Convolutional Networks (GCNs) achieve an impressive performance due to the remarkable representation ability in learning the graph information.
Zulun Zhu +5 more
semanticscholar +1 more source
Balancedness and the Least Laplacian Eigenvalue of Some Complex Unit Gain Graphs
Let 𝕋4 = {±1, ±i} be the subgroup of 4-th roots of unity inside 𝕋, the multiplicative group of complex units. A complex unit gain graph Φ is a simple graph Γ = (V (Γ) = {v1, . . .
Belardo Francesco +2 more
doaj +1 more source
A Matrix Approach for Analyzing Signal Flow Graph
Mason’s gain formula can grow factorially because of growth in the enumeration of paths in a directed graph. Each of the (n − 2)! permutation of the intermediate vertices includes a path between input and output nodes.
Shyr-Long Jeng +2 more
doaj +1 more source
Density Gain-Rate Peaks for Spectral Clustering
Clustering has been troubled by varying shapes of sample distributions, such as line and spiral shapes. Spectral clustering and density peak clustering are two feasible techniques to address this problem, and have attracted much attention from academic ...
Jiexing Liu, Chenggui Zhao
doaj +1 more source
Coloring permutation-gain graphs
Correspondence colorings of graphs were introduced in 2018 by Dvořák and Postle as a generalization of list colorings of graphs which generalizes ordinary graph coloring. Kim and Ozeki observed that correspondence colorings generalize various notions of signed-graph colorings which again generalizes ordinary graph colorings.
openaire +2 more sources

