Results 271 to 280 of about 24,126 (306)
Lorentz-regularized interpretable VAE for multi-scale single-cell transcriptomic and epigenomic embeddings. [PDF]
Front GenetFu Z, Fu J, Chen C, Zhang K, Wang S.
europepmc +1 more source
CEEMDAN-SST-GraphPINN-TimesFM Model Integrating Operating-State Segmentation and Feature Selection for Interpretable Prediction of Gas Concentration in Coal Mines. [PDF]
Sensors (Basel)Yuan L.
europepmc +1 more source
Scalable Semi-Supervised Learning by Efficient Anchor Graph Regularization
IEEE Transactions on Knowledge and Data Engineering, 2016 © 1989-2012 IEEE. Many graph-based semi-supervised learning methods for large datasets have been proposed to cope with the rapidly increasing size of data, such as Anchor Graph Regularization (AGR).
Meng Wang, Weijie Fu, Shijie Hao
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Regular factors of regular graphs
Journal of Graph Theory, 1985AbstractGiven r ⩾ 3 and 1 ⩽ λ ⩽ r, we determine all values of k for which every r‐regular graph with edge‐connectivity λ has a k‐factor.
Béla Bollobás +2 more
openaire +2 more sources
Journal of Graph Theory, 2017
AbstractA graph is called equimatchable if all of its maximal matchings have the same size. Kawarabayashi, Plummer, and Saito showed that the only connected equimatchable 3‐regular graphs are K4 and K3, 3. We extend this result by showing that for an odd positive integer r, if G is a connected equimatchable r‐regular graph, then .
Saieed Akbari +3 more
openaire +1 more source
AbstractA graph is called equimatchable if all of its maximal matchings have the same size. Kawarabayashi, Plummer, and Saito showed that the only connected equimatchable 3‐regular graphs are K4 and K3, 3. We extend this result by showing that for an odd positive integer r, if G is a connected equimatchable r‐regular graph, then .
Saieed Akbari +3 more
openaire +1 more source
Graph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain
IEEE Transactions on Image Processing, 2017 Inverse imaging problems are inherently underdetermined, and hence, it is important to employ appropriate image priors for regularization. One recent popular prior - the graph Laplacian regularizer - assumes that the target pixel patch is smooth with ...
Jiahao Pang, Gene Cheung
exaly +2 more sources
Regular Graphs, Eigenvalues and Regular Factors
Journal of Graph Theory, 2011AbstractIn this article, we obtain a sufficient condition for the existence of regular factors in a regular graph in terms of its third largest eigenvalue. We also determine all values of k such that every r‐regular graph with the third largest eigenvalue at most has a k‐factor.
openaire +2 more sources
Journal of Intelligent & Fuzzy Systems, 2016
A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs. In this paper, some properties of an edge regular vague graph are given.
Rajab Ali Borzooei +3 more
openaire +1 more source
A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs. In this paper, some properties of an edge regular vague graph are given.
Rajab Ali Borzooei +3 more
openaire +1 more source