Results 21 to 30 of about 3,761,116 (301)
Bounds for the rank of a complex unit gain graph in terms of the independence number [PDF]
Linear and multilinear algebra, 2019 A complex unit gain graph (or -gain graph) is a triple (or for short) consisting of a simple graph G with , as the underlying graph of , the set of unit complex numbers and a gain function with the property that . The adjacency matrix of is , where if is
Shengjie He, Rongxia Hao, A. Yu
semanticscholar +1 more source
A dual‐modal graph attention interaction network for person Re‐identification
IET Computer Vision, 2023 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]
IEEE Robotics and Automation Letters, 2022 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
Spiking Graph Convolutional Networks [PDF]
International Joint Conference on Artificial Intelligence, 2022 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
A Matrix Approach for Analyzing Signal Flow Graph
Information, 2020 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
IEEE Access, 2021 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
Effective Seed Scheduling for Fuzzing with Graph Centrality Analysis [PDF]
IEEE Symposium on Security and Privacy, 2022 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
Certain operations on interval-valued picture fuzzy graphs with application
International Journal of Mathematics for Industry, 2023 Graph theory has various applications in computer science, such as image segmentation, clustering, data mining, image capturing, and networking. Fuzzy graph (FG) theory has been widely adopted to handle uncertainty in graph-related problems.
Biswajit Das Adhikari +3 more
doaj +1 more source
Neural Motifs: Scene Graph Parsing with Global Context [PDF]
2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2017 We investigate the problem of producing structured graph representations of visual scenes. Our work analyzes the role of motifs: regularly appearing substructures in scene graphs.
Rowan Zellers +3 more
semanticscholar +1 more source
New Journal of Physics, 2021 Non-Hermitian (NH) topological states, such as the doubly-degenerate nodes dubbed as exceptional points (EPs) in Bloch band structure of 2D lattices driven by gain and loss, have attracted much recent interest.
Hang Liu, Sheng Meng, Feng Liu
doaj +1 more source