Results 111 to 120 of about 121,348 (314)
Location‐Assisted Graph‐Based User Scheduling in Multi‐User MIMO LEO NTN Systems
International Journal of Satellite Communications and Networking, EarlyView.ABSTRACT This paper addresses user clustering and scheduling for multi‐user MIMO low Earth orbit nonterrestrial network systems in full frequency reuse. Since the number of on‐ground user terminals is usually much higher than the number of on‐board LEO satellite antennas, user scheduling becomes a fundamental task.
Bilal Ahmad +4 more
wiley +1 more source
, 2006 There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves.
Evans, Steven N., Matsen, Frederick A.
core +3 more sources
Characterization of the Carbonyl Metalates [Mn2(CO)8]2− and [W2(CO)8]4− Featuring M=M Double Bonds
Zeitschrift für anorganische und allgemeine Chemie, EarlyView.The novel homoleptic carbonyl metalate anions [Mn2(CO)8]2− and [W2(CO)8]4− featuring M=M double bonds are structurally characterized and investigated using quantum chemical calculations and QTAIM methods. The crystal structures of [Rb[2.2.2]crypt]2[Mn2(CO)8] ⋅ 4NH3 and [K[18]crown‐6]2K2[W2(CO)8] ⋅ 14NH3 are reported, containing the first homoleptic ...
Michael Witzmann +2 more
wiley +1 more source
, 2014 The 1D discrete fractional Laplacian operator on a cyclically closed (periodic) linear chain with finitenumber $N$ of identical particles is introduced. We suggest a "fractional elastic harmonic potential", and obtain the $N$-periodic fractionalLaplacian
Collet, Bernard +3 more
core
Oversampled Graph Laplacian Matrix For Graph Signals
, 2014 Publication in the conference proceedings of EUSIPCO, Lisbon, Portugal ...
Sakiyama, Akie, Tanaka, Yuichi
openaire +1 more source
Taylor Expansion Proof of the Matrix Tree Theorem - Part I
, 2013 The Matrix-Tree Theorem states that the number of spanning trees of a graph is given by the absolute value of any cofactor of the Laplacian matrix of the graph.
Zernik, Amitai
core
CAAI Transactions on Intelligence Technology, EarlyView.Abstract Graph neural networks (GNNs) have revolutionised the processing of information by facilitating the transmission of messages between graph nodes. Graph neural networks operate on graph‐structured data, which makes them suitable for a wide variety of computer vision problems, such as link prediction, node classification, and graph classification.
Amit Sharma +4 more
wiley +1 more source
Enhancing generalized spectral clustering with embedding Laplacian graph regularization
CAAI Transactions on Intelligence Technology, EarlyView.Abstract An enhanced generalised spectral clustering framework that addresses the limitations of existing methods by incorporating the Laplacian graph and group effect into a regularisation term is presented. By doing so, the framework significantly enhances discrimination power and proves highly effective in handling noisy data.
Hengmin Zhang +5 more
wiley +1 more source
On spectrum and energies of enhanced power graphs
Mathematics OpenThe enhanced power graph [Formula: see text] of a group G is a simple graph with vertex set G and two distinct vertex are adjacent if and only if they belong to the same cyclic subgroup.
Pankaj Kalita, Prohelika Das
doaj +1 more source
A note on the third invariant factor of the Laplacian matrix of a graph [PDF]
, 2009 Jian Wang, Yong-Liang Pan
openalex +1 more source