Results 211 to 220 of about 1,660,013 (253)
Automatic left ventricular segmentation in echocardiography is critical for cardiac function assessment but remains challenging due to limited crossdomain feature interaction. This paper proposes SFMFNet, a Spatial‐Frequency Multi‐Scale Fusion Network that integrates multiscale convolution, wavelet transform, and Fourier transform.
Dang Li +3 more
wiley +1 more source
A unifying device–cardiovascular interface framework is presented to classify implantable cardiovascular technologies as intracardiovascular blood‐contacting systems or extracardiovascular tissue‐only and blood‐handling architectures. Cross‐class comparison across shared semiquantitative criteria, including blood‐contact burden, biomimicry ...
Bergo Nicolò +7 more
wiley +1 more source
Secure vertex cover of a graph
We study the problem of using mobile guards to defend the vertices of a graph [Formula: see text] against a single attack on its vertices. A vertex cover of a graph [Formula: see text] is a set [Formula: see text] such that for each edge [Formula: see text], at least one of [Formula: see text] or [Formula: see text] is in [Formula: see text].
P. Roushini Leely Pushpam +1 more
openaire +4 more sources
Vertex and Edge Covers With Clustering Properties: Complexity and Algorithms [PDF]
We consider the concepts of a t-total vertex cover and a t-total edge cover (t≥1), which generalise the notions of a vertex cover and an edge cover, respectively.
David Francis Manlove, Henning Fernau
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A probabilistic algorithm for vertex cover
Theoretical Computer Science, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Berend, S. Mamana
openaire +3 more sources
A 5k-vertex kernel for 3-path vertex cover
Theoretical Computer Science, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mingyu Xiao 0001, Shaowei Kou
openaire +1 more source
Refined memorization for vertex cover
Information Processing Letters, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
L. Sunil Chandran +1 more
openaire +5 more sources
Algorithmica, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leah Epstein +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leah Epstein +2 more
openaire +1 more source
Maximum Minimal Vertex Cover Parameterized by Vertex Cover
SIAM Journal on Discrete Mathematics, 2015The parameterized complexity of problems is often studied with respect to the size of their optimal solutions. However, for a maximization problem, the size of the optimal solution can be very large, rendering algorithms parameterized by it inefficient. Therefore, we suggest studying the parameterized complexity of maximization problems with respect to
openaire +3 more sources
On approximation of max-vertex-cover
European Journal of Operational Research, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qiaoming Han +3 more
openaire +1 more source

