Results 161 to 170 of about 2,151,737 (304)
Dual-Branch Graph Learning with Frequency Gating for Industrial Sensor Anomaly and Cyberattack Detection. [PDF]
Zhao T, Yang W, Yao Y.
europepmc +1 more source
Spectral segmentation with multiscale graph decomposition
Timothée Cour, F. Bénézit, Jianbo Shi
semanticscholar +1 more source
SKALE 2.0 maps disease‐associated protein aggregation as a phase‐resolved structural process, linking mutation‐induced geometric perturbations to nucleation, elongation, and suppressor design. Across neurodegenerative proteins, the framework reveals cryptic aggregation vulnerabilities, separates phase‐concordant and phase‐switching mutations, and ...
Jia Shen Sio +6 more
wiley +1 more source
Federated spatial-temporal traffic forecasting with VMD-enhanced graph attention and LSTM. [PDF]
Mundada T, Ramdhave S, Jain S, Gupta S.
europepmc +1 more source
Bipartite Approximation for Graph Wavelet Signal Decomposition
Jin Zeng, Gene Cheung, Antonio Ortega
semanticscholar +1 more source
CauFinder: Steering Cell‐State and Phenotype Transitions by Causal Disentanglement Learning
CauFinder combines causal disentanglement modeling and network control to prioritize causal drivers of cell‐state transitions from observational transcriptomic data. The framework separates transition‐relevant signals from spurious associations, nominates intervention targets across biological and disease contexts, and identifies DAAM1 as an actionable
Chengming Zhang +11 more
wiley +1 more source
Wavelet-Decoupled Spatiotemporal Network for Stock Return Prediction. [PDF]
Liao L, Wang C, Wang J, Liao Y, Lai Y.
europepmc +1 more source
Decoupling biological signals from unwanted variation in multi‑condition single‑cell RNA sequencing data remains challenging. CAPER disentangles condition‑associated biological effects from sample heterogeneity through matrix factorization, producing interpretable latent factors and a batch‑corrected expression matrix.
Ye Li +6 more
wiley +1 more source
Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity. [PDF]
de Vos T, Christiansen A.
europepmc +1 more source
Efficiently computing k-edge connected components via graph decomposition
Lijun Chang +5 more
semanticscholar +1 more source

