A measurement-driven graph learning framework for Wideband oscillation localization in power systems. [PDF]
Dong Z +8 more
europepmc +1 more source
Geometry‐driven thermal behavior in wire‐arc additive manufacturing (WAAM) influences microstructural evolution during nonequilibrium solidification of a chemically complex Fe–Cr–Nb–W–Mo–C nanocomposite system. By comparing different deposits configurations, distinct entropy–cooling rate correlations, segregation, and carbide evolution are revealed ...
Blanca Palacios +5 more
wiley +1 more source
MSF-HierGNN: a multi-source substructure-fusion hierarchical GNN method and web server to predict molecular property for drug design. [PDF]
Xiao M +6 more
europepmc +1 more source
AGCLD: an adaptive graph contrastive learning method with denoising for spatial domain identification. [PDF]
Li Y +5 more
europepmc +1 more source
Hierarchical neighbor integration graph attention network for autism spectrum disorder diagnosis. [PDF]
Ma D, Peng L, Zhang L, Li W, Gao X.
europepmc +1 more source
MCFST: spatial domain identification method based on multi-view graph convolutional network and graph fusion network. [PDF]
Zhang Z, Duan H, Gao X.
europepmc +1 more source
Multi-Sensor Fusion SLAM Based on LiDAR, IMU and GPS for Structured Urban Scenes. [PDF]
Lu J, Shen Y, Wang X, Ke F.
europepmc +1 more source
Related searches:
On Complementary Graph Entropy
IEEE Transactions on Information Theory, 2009It has been recently discovered that complementary graph entropy characterizes (and offers new insights into) the minimum asymptotic rate for zero-error source coding with decoder side information. This paper presents new results that build on and complement this discovery.
Ertem Tuncel, Kenneth Rose
exaly +2 more sources
On complementary decompositions of the complete graph
Graphs and Combinatorics, 1989In this remarkable paper the authors consider decompositions \(K_ n\to H\), where H is either \(P_ 3\) (the path with 3 edges) or the complete bipartite graph \(K_{1,3}\), with the property that upon taking the complement of each graph in the decomposition one obtains a new decomposition \(K_ n\to H^ c.\) Two main results are obtained.
Andrew Granville
exaly +3 more sources

