Results 111 to 120 of about 2,824,860 (307)

Spatial and Volumetric Characteristics of Glioblastoma: Associations With Clinical Presentation and Survival

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective We aim to comprehensively analyze how regional tumor and edema characteristics are associated with clinical presentations and survival outcomes in a large cohort of glioblastoma patients. Methods Patients with IDH‐wildtype glioblastoma who received brain MRI from 2010 to 2023 were included.
Daniel J. Zhou   +16 more
wiley   +1 more source

A Method for Obtaining Randomized Algorithms with Small Tail Probabilities [PDF]

open access: yes, 1991
We study strategies for converting randomized algorithms of the Las Vegas type into randomized algorithms with small tail ...
Wigderson, A.   +5 more
core  

A New Perspective on Randomized Gossip Algorithms [PDF]

open access: yes, 2016
In this short note we propose a new approach for the design and analysis of randomized gossip algorithms which can be used to solve the average consensus problem.
Nicolas Loizou   +3 more
core   +1 more source

Randomized Algorithms for Matrices and Data [PDF]

open access: yesFoundations and Trends® in Machine Learning, 2011
Randomized algorithms for very large matrix problems have received a great deal of attention in recent years. Much of this work was motivated by problems in large-scale data analysis, largely since matrices are popular structures with which to model data drawn from a wide range of application domains, and this work was performed by individuals from ...
openaire   +3 more sources

Uncovering G Protein‐Coupled Receptors: Novel Targets and Biomarkers for Predicting Glioma Prognosis

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Low‐grade gliomas (LGG) exhibit significant heterogeneity and recurrence risk. G protein‐coupled receptors (GPCR) contribute to glioma malignant progression, but their prognostic value remains unclear. This work attempts to formulate a GPCR‐based outcome‐predicting model for LGG. Methods Based on TCGA LGG data, the enrichment scores
Jun Yang   +4 more
wiley   +1 more source

A Two‐Stage Questionnaire and Actigraphy Screening for iRBD in a Multicenter Retrospective Cohort

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Isolated rapid‐eye‐movement sleep behavior disorder is a prodromal marker of synucleinopathies. However, most cases remain undiagnosed due to the insufficient predictive value of questionnaires and limited access to confirmatory video‐polysomnography. We assessed a two‐stage screening strategy combining a brief questionnaire on rapid‐
Caleb A. Massimi   +17 more
wiley   +1 more source

New Old Algorithms for Stochastic Scheduling [PDF]

open access: yes, 2005
We consider the stochastic identical parallel machine scheduling problem and its online extension, when the objective is to minimize the expected total weighted completion time of a set of jobs that are released over time.
Schulz, Andreas S.
core   +1 more source

Ensemble Kalman inversion for image guided guide wire navigation in vascular systems

open access: yesJournal of Mathematics in Industry
This paper addresses the challenging task of guide wire navigation in cardiovascular interventions, focusing on the parameter estimation of a guide wire system using Ensemble Kalman Inversion (EKI) with a subsampling technique.
Matei Hanu   +5 more
doaj   +1 more source

Cognitive and Neuroimaging Divergence Between Juvenile and Adult FUS Amyotrophic Lateral Sclerosis

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Amyotrophic lateral sclerosis (ALS) is a neurodegenerative disorder characterized by progressive motor neuron degeneration. Fused in sarcoma (FUS)‐associated juvenile ALS (jALS) represents a distinct and aggressive subgroup with rapid deterioration and poor prognosis.
Alexandra V. Jürs   +7 more
wiley   +1 more source

Privacy Preserving Randomized Gossip Algorithms [PDF]

open access: yes, 2017
In this work we present three different randomized gossip algorithms for solving the average consensus problem while at the same time protecting the information about the initial private values stored at the nodes. We give iteration complexity bounds for
Richtárik, Peter   +4 more
core   +2 more sources

Home - About - Disclaimer - Privacy