Results 131 to 140 of about 2,517,848 (305)
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
The goal of this manuscript is to introduce a new Stancu generalization of the modified Szász–Kantorovich operator connecting Riemann–Liouville fractional operators via Charlier polynomials.
Nadeem Rao +2 more
doaj +1 more source
ABSTRACT Objective The prognosis of glioblastoma (GBM) remains highly unfavorable, largely due to high tumor heterogeneity and an immunosuppressive microenvironment. However, the functional role of PANoptosis in this context is poorly understood. Methods Patients were stratified via K‐means clustering. A risk score model was constructed using prognosis‐
Langfei Tian +6 more
wiley +1 more source
This work concerns the harmonization of geospatial data to improve linkages between place-based characteristics and health outcomes. Such data are typically available as geographic layers, each representing a distinct attribute (e.g., income or distance ...
Armin R. Mikler +2 more
doaj +1 more source
Better Approximation Algorithms for the Graph Diameter
The diameter is a fundamental graph parameter and its computation is necessary in many applications. The fastest known way to compute the diameter exactly is to solve the All-Pairs Shortest Paths (APSP) problem.
Virginia Vassilevska Williams +11 more
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
This paper presents insertions-only algorithms for maintaining the exact and/or approximate size of the minimum edge cut and the minimum vertex cut of a graph. The algorithms output the approximate or exact size k in time O(1) and a cut of size K in time
Henzinger, Monika R. +1 more
core +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
Efficient Techniques for Low-Rank Tensor Approximation and Applications in Robust Object Detection
This paper introduces efficient randomized fixed-precision and single-pass algorithms for low-tubal-rank approximation of third-order tensors. The proposed fixed-precision algorithms are faster and more efficient than the existing algorithms for ...
Salman Ahmadi-Asl +3 more
doaj +1 more source
An Approximation Algorithm for #k-SAT
We present a simple randomized algorithm that approximates the number of satisfying assignments of Boolean formulas in conjunctive normal form. To the best of our knowledge this is the first algorithm which approximates #k-SAT for any k >= 3 within a running time that is not only non-trivial, but also significantly better than that of the currently ...
openaire +8 more sources

