Results 41 to 50 of about 38,008 (262)
Planar bichromatic minimum spanning trees
Journal of Discrete Algorithms, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Magdalene G. Borgelt +6 more
openaire +7 more sources
Interpreting the effects of DNA polymerase variants at the structural level
Molecular Oncology, EarlyView.Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source
A MINIMUM SPANNING TREE BASED METHOD FOR UAV IMAGE SEGMENTATION [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2016 This paper proposes a Minimum Span Tree (MST) based image segmentation method for UAV images in coastal area. An edge weight based optimal criterion (merging predicate) is defined, which based on statistical learning theory (SLT).
P. Wang, Z. Wei, W. Cui, Z. Lin
doaj +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background and Objectives Multiple sclerosis (MS) exhibits racially disparate rates of disease progression. Black people with MS (B‐PwMS) experience a more severe disease course than non‐Hispanic White people with MS (NHW‐PwMS). Here we investigated structural and functional connectivity as well as structure–function decoupling in the ...
Emilio Cipriano +11 more
wiley +1 more source
Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To explore whether routine outpatient video combined with deep learning‐based pose estimation and clinically interpretable kinematic features can support multi‐label phenotyping of co‐occurring hyperkinetic movement disorders (HMDs).
Laura Cif +17 more
wiley +1 more source
Journal of Numerical Analysis and Approximation Theory, 2005 We present an overview of the approximation theory in combinatorial optimization. As an application we consider the Generalized Minimum Spanning Tree (GMST) problem which is defined on an undirected complete graph with the nodes partitioned into ...
Petrică C. Pop, G. Still, W. Kern
doaj +2 more sources
Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem
Journal of Applied Mathematics, 2012 Let G=(V,E) be an undirected graph with a weight function and a cost function on edges. The constrained minimum spanning tree problem is to find a minimum cost spanning tree T in G such that the total weight in T is at most a given bound B. In this paper,
Yen Hung Chen
doaj +1 more source
Advanced Engineering Materials, EarlyView.This article presents the design, modeling, and characterization of air‐pressure–actuated programmable vibroacoustic metamaterials (PVAMM). The study focuses on leveraging air pressure to dynamically tune resonance frequencies for effective noise attenuation.
William Kaal +2 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch +3 more
wiley +1 more source
Object Tracking Using Sparsity Based Discriminative Minimum-Spanning-Tree
IEEE Access, 2019 An object tracking method based on a minimum-spanning-tree one-class classifier is proposed where the background is regarded as a collection of all other classes except the target.
Xin Man, Dun Mao, Xiaohong Lin, Fei Xia
doaj +1 more source