Results 51 to 60 of about 1,405 (240)
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known MAX LEAF SPANNING TREE problem. In the generalized WEIGHTED MAX LEAF problem we get as input an undirected connected graph G, a rational number k not smaller than 1 and a weight ...
Bart Jansen
doaj +1 more source
Budgeted Passive-Aggressive Learning for Online Multiclass Classification
Online multiclass classification is a specific problem of online learning that performs a sequence of multiclass classification tasks given the knowledge of previous tasks. The goal is to make correct predictions for this sequence.
Chung-Hao Wu +2 more
doaj +1 more source
Kernelization Lower Bounds for Finding Constant-Size Subgraphs [PDF]
Kernelization is an important tool in parameterized algorithmics. Given an input instance accompanied by a parameter, the goal is to compute in polynomial time an equivalent instance of the same problem such that the size of the reduced instance only ...
Nichterlein, A. +5 more
core +1 more source
Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders
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
Natural Frequencies of Levodopa‐Induced Dyskinesia in Parkinson's Disease
ABSTRACT Objectives Abnormal involuntary movements, known as dyskinesias, are common complications of levodopa treatment in patients with Parkinson's disease and can significantly impair quality of life. The underlying pathophysiology remains unclear, and current therapeutic options are limited.
Ioannis U. Isaias +3 more
wiley +1 more source
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
Given an undirected graph G=(V,E) and an integer l ≥ 1, the NP-hard 2-CLUB problem asks for a vertex set S ⊆ V of size at least l such that the subgraph induced by S has diameter at most two.
Sepp Hartung +2 more
doaj +1 more source
Stage‐Dependent β‐Synuclein Links MRI and Cognitive Decline in Alzheimer's Disease
ABSTRACT Objective Synaptic degeneration drives cognitive decline in Alzheimer's disease (AD), but synaptic biomarkers are scarce. Brain‐enriched β‐synuclein emerged as a synaptic damage marker. We investigated its diagnostic, prognostic, and structural correlates across the AD continuum.
Ulaş Ay +15 more
wiley +1 more source
A brief introduction to kernelization
Kernelization is a notion from parameterized complexity that captures the concept of efficient preprocessing for NP-hard problems. A kernelization is a polynomial-time algorithm that given an instance (x; k) with parameter k will return an equivalent ...
Kratsch, Stefan
core +1 more source
ABSTRACT Objective Progression independent of relapse activity is a major determinant of long‐term disability in multiple sclerosis, but its immunopathologic basis remains incompletely understood. We investigated whether relapse‐independent progression in radiologically stable relapsing–remitting multiple sclerosis is associated with distinct ...
Antonio Bruno +19 more
wiley +1 more source
Data‐Driven SuStaIn Model of Disability Progression in Amyotrophic Lateral Sclerosis
ABSTRACT Objective To determine whether ordinal Subtype and Stage Inference (SuStaIn) applied to routine ALSFRS‐R item scores can identify reproducible disability progression patterns in amyotrophic lateral sclerosis (ALS) and provide clinically meaningful staging.
Giammarco Milella +5 more
wiley +1 more source

