Results 91 to 100 of about 125,297 (309)

Quantum mechanics and algorithmic randomness [PDF]

Complexity, 2000
plain LaTeX, 11 ...
openaire   +2 more sources

Design of competitive paging algorithms with good behaviour in practice

, 2013
Paging is one of the most prominent problems in the field of online algorithms. We have to serve a sequence of page requests using a cache that can hold up to k pages. If the currently requested page is in cache we have a cache hit, otherwise we say that
Negoescu, Andrei Laurian
core  

High‐Resolution MRI Revealed Different Etiology‐Specific Associations With Cerebral Infarction in Adult Moyamoya Vasculopathy

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective High‐resolution MRI enables detailed assessment of intracranial vessel wall pathology in moyamoya vasculopathy. We aimed to classify adult moyamoya vasculopathy etiologies using high‐resolution MRI and to examine subtype‐specific associations between high‐resolution MRI features and ischemic infarction.
Guangsong Han, Jiachun Pan, Yuehui Hong, Xiaoyuan Fan, Ming Yao, Lixin Zhou, Yicheng Zhu, Feng Feng, Jun Ni   +8 more
wiley   +1 more source

Randomized Algorithms and Complexity Theory

, 2006
In this paper we give an introduction to the connection between complexity theory and the study of randomized algorithms. In particular, we will define and study probabilistic complexity classes, survey the basic results, and show how they relate to the ...
Hempel, Harald, Hempel,Harald
core   +1 more source

Risk of Non‐Arteritic Anterior Ischemic Optic Neuropathy in Idiopathic Intracranial Hypertension Patients Treated with GLP‐1 Receptor Agonists

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Introduction Glucagon‐like peptide‐1 receptor agonists (GLP‐1 RAs) have demonstrated significant weight‐reducing effects and may offer benefits in idiopathic intracranial hypertension (IIH); however, recent concerns about the risk of non‐arteritic anterior ischemic optic neuropathy (NAION) have emerged.
Faisal A. Al‐Harbi, Mohanad A. Alkuwaiti, Yazeed B. Alaql, Ahmed K. Alsaif, Ahmed A. Alessa, Meshari Ayed Alharbi, Mohammed Alfalah, Saud A. Alnaaim, Sajjad M. AlHaddad, Ahmed Y. Azzam   +9 more
wiley   +1 more source

The open-closed mod-minimizer algorithm

Algorithms for Molecular Biology
Sampling algorithms that deterministically select a subset of $$k$$ k -mers are an important building block in bioinformatics applications. For example, they are used to index large textual collections, like DNA, and to compare sequences quickly. In such
Ragnar Groot Koerkamp, Daniel Liu, Giulio Ermanno Pibiri   +2 more
doaj   +1 more source

Randomized Algorithms for Matrices and Data [PDF]

Foundations 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   +2 more sources

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

Annals 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, Marc Jaskir, Julian Gal, Yombe Fonkeu, Christos Davatzikos, MacLean P. Nasrallah, Jose Garcia, Rubo Xing, Stephen J. Bagley, Arati Desai, Richard E. Phillips, Steven Tobochnik, Colin A. Ellis, James J. Gugger, Nishant Sinha, Joel M. Stein, Kathryn A. Davis   +16 more
wiley   +1 more source

Fast equality test for straight-line compressed strings

, 2011
The paper describes a simple and fast randomized test for equality of grammar-compressed strings. The thorough running time analysis is done by applying a logarithmic cost measure.
Schmidt-Schauß, Manfred, Schnitger, Georg   +1 more
core  

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

Annals 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, Dongxu Zhang, Dongyuan Liu, Da Lin, Hao Wang   +4 more
wiley   +1 more source