Results 51 to 60 of about 76,384 (242)
Geometry and connectivity are complementary structures, which have demonstrated their ability to represent the brain's functional activity. This study evaluates geometric and connectome eigenmodes as biologically informed constraints for EEG source localization.
Pok Him Siu +6 more
wiley +1 more source
RECOGNITION OF HUMAN POSE FROM IMAGES BASED ON GRAPH SPECTRA [PDF]
Recognition of human pose is an actual problem in computer vision. To increase the reliability of the recognition it is proposed to use structured information in the form of graphs.
A. A. Zakharov +2 more
doaj +1 more source
Edge-enhancing Filters with Negative Weights
In [DOI:10.1109/ICMEW.2014.6890711], a graph-based denoising is performed by projecting the noisy image to a lower dimensional Krylov subspace of the graph Laplacian, constructed using nonnegative weights determined by distances between image data ...
Knyazev, Andrew
core +1 more source
Multimodal Cross‐Attentive Graph‐Based Framework for Predicting In Vivo Endocrine Disruptors
A multimodal cross‐attentive graph neural network integrates molecular graphs with androgen and estrogen adverse outcome pathway (AOP)–anchored in vitro assay signals to predict in vivo endocrine disruption. By fusing information on Tier‐1 AOP logits with chemical structures, the framework achieves high accuracy and provides assay‐traceable ...
Eder Soares de Almeida Santos +6 more
wiley +1 more source
For network graphs, numerous graph features are intimately linked to eigenvalues of the Laplacian matrix, such as connectivity and diameter. Thus, it is very important to solve eigenvalues of the Laplacian matrix for graphs.
Changlei Zhan, Xiangyu Li, Jie Chen
doaj +1 more source
A graph is said to be borderenergetic (-borderenergetic, respectively) if its energy (Laplacian energy, respectively) equals the energy (Laplacian energy, respectively) of the complete graph .
Qingyun Tao, Yaoping Hou
doaj +1 more source
Bayesian Regularization via Graph Laplacian
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Fei +4 more
openaire +2 more sources
CellFreeGMF traces plasma cfRNA to likely originating cell types by integrating single‐cell atlases with graph‐regularized matrix factorization. The method decomposes cfRNA profiles into sample–cell contributions to reconstruct pseudo single‐cell expression.
Wenxiang Zhang +9 more
wiley +1 more source
Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic
We present a linear-time algorithm that computes in a given real interval the number of eigenvalues of any symmetric matrix whose underlying graph is unicyclic.
R. O. Braga +2 more
doaj +1 more source
On the Approximation of Laplacian Eigenvalues in Graph Disaggregation
Graph disaggregation is a technique used to address the high cost of computation for power law graphs on parallel processors. The few high-degree vertices are broken into multiple small-degree vertices, in order to allow for more efficient computation in
Hu, Xiaozhe +2 more
core +1 more source

