Results 251 to 260 of about 2,858,268 (305)

Hyperbolic Kernel Graph Neural Networks for Neurocognitive Decline Analysis From Multimodal Brain Imaging. [PDF]

IEEE Trans Pattern Anal Mach Intell
Yang M, Sun Y, Wang Q, Bozoki A, Kohi M, Liu M.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Target adjacency effect estimation using ground spectrum measurement and Landsat-5 Satellite data

IEEE Transactions on Geoscience and Remote Sensing, 2006
This paper addresses the estimation of adjacency effect in ground spectrum and Landsat-5 pixels. The adjacency effect influences the digital number value of a pixel by adding surface surrounding scatter signals and path scatter signals at the sensor.
null Ma Jianwen, null Li Xiaowen, null Chen Xue, null Feng Chun   +3 more
semanticscholar   +5 more sources

On the adjacency spectrum of zero divisor graph of ring ℤn

Journal of Algebra and Its Applications, 2021
The zero divisor graph [Formula: see text] of a commutative ring [Formula: see text] with unity is a simple undirected graph whose vertices are all nonzero zero divisors of [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text].
Saraswati Bajaj, Pratima Panigrahi
openaire   +2 more sources

Hermitian Adjacency Spectrum of Cayley Digraphs over Dihedral Group

Algebra Colloquium, 2020
We first study the spectrum of Hermitian adjacency matrix (H-spectrum) of Cayley digraphs X(D2n, S) on dihedral group D2n with |S| = 3. Then we show that all Cayley digraphs X(D2p, S) with |S| = 3 and p odd prime are Cay-DS, namely, for any Cayley digraph X(D2p, T), X(D2p, T) and X(D2p, S) having the same H-spectrum implies that they are isomorphic.
Honghai Li, Teng Yu
openaire   +2 more sources

Adjacency Spectrum of Reduced Power Graphs of Finite Groups

Algebra Colloquium
The reduced power graph of a group [Formula: see text], denoted by [Formula: see text], is the graph whose vertex set is the set of all elements of [Formula: see text] and two vertices [Formula: see text] and [Formula: see text] are adjacent in [Formula: see text] if and only if [Formula: see text] or [Formula: see text].
R. Rajkumar, T. Anitha
openaire   +2 more sources

Opaque virtual network mapping algorithms based on available spectrum adjacency for elastic optical networks

Science China Information Sciences, 2016
Optical network virtualization enables multiple virtual optical networks constructed for different infrastructure users (renters) or applications coexist over a physical infrastructure. Virtual optical network (VON) mapping algorithm is used to allocate necessary resources in the physical infrastructure to the VON requests (VRs).
Hongxiang Wang, Jingxi Zhao, Hui Li, Yuefeng Ji   +3 more
openaire   +2 more sources

Detection and correction of adjacency effects in hyperspectral airborne data of coastal and inland waters: the use of the near infrared similarity spectrum

International Journal of Remote Sensing, 2011
S. Sterckx, E. Knaeps, K. Ruddick
semanticscholar   +3 more sources

On Spectrum of Neighbourhood Corona Product of Signed Graphs

, 2023
Given two signed graphs $\Gamma_1$ with nodes $\{u_1,u_2,\cdots,u_n\}$ and $\Gamma_2$, the neighbourhood corona, $\Gamma_1*\Gamma_2$ is the signed graph obtained by taking one copy of $\Gamma_1$ and $n_1$ copies of $\Gamma_2$, and joining every neighbour
Bishal Sonar, Satyam Guragain, Ravi Srivastava   +2 more
semanticscholar   +1 more source