Results 11 to 20 of about 8,004,238 (365)
Spatial Temporal Graph Convolutional Networks for Skeleton-Based Action Recognition [PDF]
AAAI Conference on Artificial Intelligence, 2018 Dynamics of human body skeletons convey significant information for human action recognition. Conventional approaches for modeling skeletons usually rely on hand-crafted parts or traversal rules, thus resulting in limited expressive power and ...
Sijie Yan, Yuanjun Xiong, Dahua Lin
semanticscholar +1 more source
Quotient graphs for power graphs [PDF]
Rendiconti del Seminario Matematico della Università di Padova, 2017 In a previous paper of the first author a procedure was developed for counting the components of a graph through the knowledge of the components of one of its quotient graphs. Here we apply that procedure to the proper power graph \mathcal{P}_0(G) of a finite group
BUBBOLONI, DANIELA +2 more
openaire +4 more sources
Graph Powers and Graph Homomorphisms [PDF]
The Electronic Journal of Combinatorics, 2010 In this paper, we investigate some basic properties of fractional powers. In this regard, we show that for any non-bipartite graph $G$ and positive rational numbers ${2r+1\over 2s+1} < {2p+1\over 2q+1}$, we have $G^{2r+1\over 2s+1} < G^{2p+1\over 2q+1}$. Next, we study the power thickness of $G$, that is, the supremum of rational numbers ${2r+
Ali Taherkhani, Hossein Hajiabolhassan
openaire +3 more sources
Spanning connectedness and Hamiltonian thickness of graphs and interval graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 A spanning connectedness property is one which involves the robust existence of a spanning subgraph which is of some special form, say a Hamiltonian cycle in which a sequence of vertices appear in an arbitrarily given ordering, or a Hamiltonian path in ...
Peng Li, Yaokun Wu
doaj +1 more source
Dynamic Graph CNN for Learning on Point Clouds [PDF]
ACM Transactions on Graphics, 2018 Point clouds provide a flexible geometric representation suitable for countless applications in computer graphics; they also comprise the raw output of most 3D data acquisition devices. While hand-designed features on point clouds have long been proposed
Yue Wang +5 more
semanticscholar +1 more source
Subsampling for graph power spectrum estimation [PDF]
International Conference on Security and Management, 2016 In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum.
S. Chepuri, G. Leus
semanticscholar +1 more source
Construction Technology of Knowledge Graph and its Application in Power Grid [PDF]
E3S Web of Conferences, 2021 With the rapid development of energy internet, dispatchers need to learn more knowledge with wider scope and fast update speed. It’s urgent to realize the knowledge electrification, knowledge systematization, knowledge visualization and knowledge sharing
Xiaoping Gai +5 more
doaj +1 more source
Spatio-Temporal Graph Neural Networks for Multi-Site PV Power Forecasting [PDF]
IEEE Transactions on Sustainable Energy, 2021 Accurate forecasting of solar power generation with fine temporal and spatial resolution is vital for the operation of the power grid. However, state-of-the-art approaches that combine machinelearning with numerical weather predictions (NWP) have coarse ...
J. Simeunović +3 more
semanticscholar +1 more source
The cubic power graph of finite abelian groups
AKCE International Journal of Graphs and Combinatorics, 2021 Let G be a finite abelian group with identity 0. For an integer the additive power graph of G is the simple undirected graph with vertex set G in which two distinct vertices x and y are adjacent if and only if x + y = nt for some with When the additive ...
R. Raveendra Prathap, T. Tamizh Chelvam
doaj +1 more source
Permutational Powers of a Graph [PDF]
The Electronic Journal of Combinatorics, 2019 This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction recovers the classical zig-zag product of graphs when the permutation is an involution, and it is in fact more ...
Daniele D'Angeli +2 more
openaire +3 more sources