Results 31 to 40 of about 8,152,507 (265)

Dynamic Graph CNN for Learning on Point Clouds [PDF]

open access: yesACM 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

Power up! Robust Graph Convolutional Network via Graph Powering

open access: yesProceedings of the AAAI Conference on Artificial Intelligence, 2021
Graph convolutional networks (GCNs) are powerful tools for graph-structured data. However, they have been recently shown to be vulnerable to topological attacks. To enhance adversarial robustness, we go beyond spectral graph theory to robust graph theory.
Jin, Ming   +3 more
openaire   +2 more sources

Construction Technology of Knowledge Graph and its Application in Power Grid [PDF]

open access: yesE3S 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

Quotient graphs for power graphs [PDF]

open access: yesRendiconti 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 ...
BUBBOLONI, DANIELA   +2 more
openaire   +3 more sources

On Structural Expressive Power of Graph Transformers [PDF]

open access: yesKnowledge Discovery and Data Mining, 2023
Graph Transformer has recently received wide attention in the research community with its outstanding performance, yet its structural expressive power has not been well analyzed.
Wenhao Zhu   +4 more
semanticscholar   +1 more source

The cubic power graph of finite abelian groups

open access: yesAKCE 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

Spatio-Temporal Graph Neural Networks for Multi-Site PV Power Forecasting [PDF]

open access: yesIEEE 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

Ultra-short-term Interval Prediction of Wind Power Based on Graph Neural Network and Improved Bootstrap Technique

open access: yesJournal of Modern Power Systems and Clean Energy, 2023
Reliable and accurate ultra-short-term prediction of wind power is vital for the operation and optimization of power systems. However, the volatility and intermittence of wind power pose uncertainties to traditional point prediction, resulting in an ...
Wenlong Liao   +5 more
doaj   +1 more source

Research Review of the Knowledge Graph and its Application in Power System Dispatching and Operation

open access: yesFrontiers in Energy Research, 2022
With the construction of a new power system and the proposal of a double carbon goal, power system operation data are growing explosively, and the optimization of power system dispatching operation is becoming more and more complex.
Junbin Chen   +5 more
doaj   +1 more source

Clustering Powers of Sparse Graphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2020
We prove that if $G$ is a sparse graph — it belongs to a fixed class of bounded expansion $\mathcal{C}$ — and $d\in \mathbb{N}$ is fixed, then the $d$th power of $G$ can be partitioned into cliques so that contracting each of these clique to a single vertex again yields a sparse graph.
Nešetřil, Jaroslav   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy