Results 81 to 90 of about 24,126 (306)
Item-Item Collaborative Filtering via Graph Regularization
, 2022 A recommendation algorithm aims to predict the quality of a user's future interaction with certain items based on their previous interactions. As research progresses, these algorithms are becoming increasingly more complicated with the use of machine ...
Koper ook geschreven Jansen, Melle (author)
core
Non-local Graph-Based Regularization for Deformable Image Registration
, 2017 Deformable image registration aims to deliver a plausible spatial transformation between two or more images by solving a highly dimensional, ill-posed optimization problem. Covering the complexity of physiological motion has so far been limited to either
Schnabel, JA +4 more
core +2 more sources
Electronic Notes in Discrete Mathematics, 2001 Abstract Abstract A graph G , is λ-regular-stable if it has at least a maximum independent set I , such that for ∀ v ∈ V(G)\I , the number of vertices in NG(V) , ⨆ I , is constant, and equal to λ. Here we give some results for this class of graphs.
Barbosa, R., Cardoso, D.M.
openaire +2 more sources
Advanced Science, EarlyView.Antimicrobial resistance caused by Gram‐negative bacteria remains difficult to overcome due to the protective outer membrane. To address this challenge, a multi‐condition constrained generative AI framework, GenMTAMP is proposed for de novo membrane‐targeting antimicrobial peptide design by integrating physicochemical and spatial structure descriptors.
Jingxiao Yu +5 more
wiley +1 more source
Graph approximation and generalized Tikhonov regularization for signal deblurring
, 2021 Given a compact linear operator K, the (pseudo) inverse K^† is usually substituted by a family of regularizing operators Rα which depends on K itself. Naturally, in the actual computation we are forced to approximate the true continuous operator K with a
Bianchi D. +3 more
core +1 more source
Distance-Regular Graphs and Halved Graphs
European Journal of Combinatorics, 1986 Let G be a bipartite distance-regular graph with bipartition \(V(G)=X\cup Y\). Let \(V(G')=X\) and, for x and y in X, let x be adjacent to y in G' if and only if x is of distance two from y in G. Then G' is called a halved graph of G, and is distance-regular. This paper discusses whether G' is one of the known, large-diameter, distance-regular graphs.
openaire +2 more sources
Factorizing regular graphs [PDF]
Journal of Combinatorial Theory, Series B, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Advanced Science, EarlyView.STransformer is a unified deep learning framework designed to seamlessly accommodate a comprehensive landscape of spatial data. By simultaneously capturing short‐range cellular interactions and tissue‐wide semantic patterns, it extracts robust representations to accurately dissect complex tissue heterogeneity.
Xingyi Li +9 more
wiley +1 more source
Conditional gradients for total variation regularization with PDE constraints: a graph cuts approach
, 2023 <p>This module solves a PDE-constrained minimization problem with TV-regularization, using the method described in the paper "Conditional gradients for total variation regularization with PDE constraints: a graph cuts approach".</p ...
Iglesias, José A. +2 more
core +1 more source
On clique graphs and clique regular graphs
Discrete MathematicsIf $Γ$ is a graph for which every edge is in exactly one clique of order $ω$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $Γ$. We discover many general results and classifications related to these clique graph that will be useful to researchers studying these objects. In particular,
Robert R. Petro, Connor M. Phillips
openaire +2 more sources