Results 161 to 170 of about 720,784 (299)
Discrete Mathematics, 1991 AbstractH.M. Mulder introduced (0,λ)-graphs and proved that maximum (0,λ)-graphs are hypercubes. One way of generalization of this concept is to consider cycle-regular graphs. We prove that these graphs have also some regularity properties and that maximum [3, 1, 6]-cycle regular graphs are also related to hypercubes.
openaire +2 more sources
Dynamic Graph Regularization for Multi-Stream Concept Drift Self-adaptation
Concept drift is an inevitable problem in non-stationary data stream environments, due to changes in data distribution over time. In practical applications, multi-stream data is more common and complex than single-stream data, yet they have received ...
Zhang, G, Lu, P, Lu, J, Zhou, M
core +1 more source
Advanced Intelligent Discovery, EarlyView.A machine learning framework simultaneously predicts four critical properties of monomers for emulsion polymerization: propagation rate constant, reactivity ratios, glass transition temperature, and water solubility. These tools can be used to systematically identify viable bio‐based monomer pairs as replacements for conventional formulations, with ...
Kiarash Farajzadehahary +1 more
wiley +1 more source
AI‐Driven Cancer Multi‐Omics: A Review From the Data Pipeline Perspective
Advanced Intelligent Discovery, EarlyView.The exponential growth of cancer multi‐omics data brings opportunities and challenges for precision oncology. This review systematically examines AI's role in addressing these challenges, covering generative models, integration architectures, Explainable AI for clinical trust, clinical applications, and key directions for clinical translation.
Shilong Liu, Shunxiang Li, Kun Qian
wiley +1 more source
Geocarto InternationalTo address challenges in urban building digitization, such as data redundancy, structural ambiguity, and boundary inaccuracy, this paper proposes a topological reconstruction method integrating deep semantic segmentation and adjacency constraints ...
Ruihan Yao +5 more
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1986 A spanning subgraph F of a graph G is called a [k-1,k]-factor if \(k-1\leq d_ F(x)\leq k\) for all vertices of x of G, where \(d_ F(x)\) denotes the degree of x in F. \textit{W. T. Tutte} [The subgraph problem, Ann. Discrete Math. 3, 289-295 (1978; Zbl 0377.05034)] proved that if r is an odd integer, then every r-regular graph has a [k-1,k]-factor for ...
openaire +3 more sources
Learning on graph with Laplacian regularization
, 2007 We consider a general form of transductive learning on graphs with Laplacian regularization, and derive margin-based generalization bounds using appropriate geometric properties of the graph.
Ando, Rie Kubota, Zhang, Tong
core
MolMiner: Toward Controllable, Three‐Dimensional‐Aware, Fragment‐Based Molecular Design
Advanced Intelligent Discovery, EarlyView.MolMiner is a fragment‐based, geometry‐aware, and order‐agnostic generative model for molecular design with strong inductive biases. Using symmetry‐aware fragment assembly, dynamic three‐dimensional geometry, and multi‐property conditioning, MolMiner enables interpretable and controllable molecular generation.
Raul Ortega‐Ochoa +2 more
wiley +1 more source
Graph-Enhanced Expectation Maximization for Emission Tomography
Journal of ImagingEmission tomography, including single-photon emission computed tomography (SPECT), requires image reconstruction from noisy and incomplete projection data.
Ryosuke Kasai, Hideki Otsuka
doaj +1 more source
Physics‐Guided Modeling of Temperature‐Dependent Electrical Conductivity of Functional Oxides
Advanced Intelligent Discovery, EarlyView.This complete workflow presents an automated, data‐driven screening of functional oxides based on their predicted electrical conductivity. A curated dataset is fed into TriCondNet, a charge‐transport, physics‐guided neural network that classifies an input composition's conduction mechanism and then simulates its conductivity–temperature profile.
Elias Assaad +6 more
wiley +1 more source