Results 121 to 130 of about 3,054,349 (257)
Persistent Monitoring for Points of Interest with Different Data Update Deadlines
In this paper, we study the regular sensory data collection of Points of Interest (PoIs) with multiple Unmanned Aerial Vehicles (UAVs) during an extended monitoring period, where each PoI is visited multiple times before its data update deadline to keep ...
Qing Guo, Jian Peng
doaj +1 more source
Predictive Value of Composite Inflammatory Markers for Stroke Prognosis: A Prospective Cohort Study
ABSTRACT Background Novel composite inflammatory markers' role in stroke prognosis is understudied, and the best predictor is unclear, requiring further exploration. Objectives This study aimed to systematically evaluate the associations of 6 novel composite inflammatory markers on stroke prognosis.
Bing Wu +7 more
wiley +1 more source
Complexity results and exact algorithms for robust knapsack problems. [PDF]
This paper studies the robust knapsack problem, for which solutions are, up to a certain point, immune to data uncertainty. We complement the works found in the literature where uncertainty affects only the profits or only the weights of the items by ...
Leus, Roel, Talla Nobibon, Fabrice
core
Some complexity results on semipaired domination in graphs
Let [Formula: see text] be a graph without any isolated vertices. A semipaired dominating set [Formula: see text] of G, is a dominating set of G, if D can be partitioned into cardinality 2 subsets such that the vertices in each of these subsets are at ...
Vikash Tripathi, Kusum, Arti Pandey
doaj +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
A Method For Approximating Univariate Convex Functions Using Only Function Value Evaluations [PDF]
In this paper, piecewise linear upper and lower bounds for univariate convex functions are derived that are only based on function value information. These upper and lower bounds can be used to approximate univariate convex functions.
Siem, A.Y.D. +2 more
core
A 3-approximation algorithm for the subtree between phylogenies
In this paper, we give a (polynomial-time) 3-approximation algorithm for the rooted subtree prune and regraft distance between two phylogenetic trees. This problem is known to be NP-complete and the best previously known approximation algorithm is a 5 ...
McCartin, C. +2 more
core +1 more source
ABSTRACT Objective Treatment of disorders of consciousness (DoC) remains a major clinical challenge, and noninvasive, targeted modulation of deep brain structures has emerged as a promising therapeutic strategy. We aimed to evaluate the feasibility/safety and preliminary effects of thalamic temporal interference stimulation (TIS) targeting centromedian‐
Gengyao Hu +7 more
wiley +1 more source
Global Rather Than Vertical‐Selective Saccadic Abnormalities in Progressive Supranuclear Palsy
ABSTRACT Objective To test whether vertical saccades are preferentially affected in Progressive Supranuclear Palsy (PSP). Methods PSP patients (n = 24) were compared to age‐matched controls (n = 94) and two degenerative groups (Alzheimer's disease, n = 20; Lewy body disease, n = 50).
Duy Duan Nguyen +6 more
wiley +1 more source
A Lasserre SDP Rounding Approximation Algorithm for Max Directed 3-Section
We consider the Max Directed 3-Section problem, which is closely connected to other well-known graph partition problems, such as Max Cut and Max Bisection.
Guangfeng Li +3 more
doaj +1 more source

