Results 141 to 150 of about 2,517,848 (305)

Boundary‐Dependent Sleep–Wake Dysregulation in Idiopathic Hypersomnia

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Idiopathic hypersomnia (IH) presents with excessive daytime sleepiness (EDS) despite apparently preserved nocturnal sleep, challenging traditional models of hypersomnolence based on sleep loss or fragmentation. We aimed to test the hypothesis that EDS in IH reflects excessive stabilization of the sleep state, consistent with ...
Samantha Mombelli   +13 more
wiley   +1 more source

New practical algorithms for the approximate shortest lattice vector [PDF]

open access: yes, 2005
We present a practical algorithm that given an LLL-reduced lattice basis of dimension n, runs in time O(n3(k=6)k=4+n4) and approximates the length of the shortest, non-zero lattice vector to within a factor (k=6)n=(2k). This result is based on reasonable
Schnorr, Claus Peter
core  

Alzheimer's Disease Biomarkers Measured by Capillary Blood Collection Versus Venous Plasma and Cerebrospinal Fluid

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Blood biomarkers are increasingly critical for non‐invasive Alzheimer's Disease (AD) diagnostics and research but typically require on‐site processing. Remote point‐of‐care collection methods could enhance biomarker testing in clinical and research settings.
Sara Ho   +9 more
wiley   +1 more source

Temporal Divergence of True and False Alarms in Pediatric Nocturnal Seizure Monitoring

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
The early‐morning surge in false seizure alarms supports exploring time‐ or state‐dependent detection thresholds to reduce false detections. ABSTRACT Seizure detection devices can improve the safety of children with epilepsy, yet high false alarms limit their clinical applicability.
Mohammad Shahbakhti   +6 more
wiley   +1 more source

Approximation algorithms for combinatorial problems

open access: yesProceedings of the fifth annual ACM symposium on Theory of computing - STOC '73, 1973
Simple, polynomial-time, heuristic algorithms for finding approximate solutions to various polynomial complete optimization problems are analyzed with respect to their worst case behavior, measured by the ratio of the worst solution value that can be chosen by the algorithm to the optimal value.
openaire   +2 more sources

Early Clinical and Cerebrospinal Fluid Predictors of 1‐Year Recurrence in Autoimmune GFAP Astrocytopathy

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Autoimmune glial fibrillary acidic protein astrocytopathy (GFAP‐A) is an inflammatory central nervous system disorder with variable outcomes. Relapse occurs in a subset of patients, but early predictors remain unclear. We aimed to identify admission‐available features associated with 1‐year recurrence and develop an interpretable ...
Qingting Hong   +10 more
wiley   +1 more source

On Estimation Algorithms vs Approximation Algorithms.

open access: yes, 2008
In a combinatorial optimization problem, when given an input instance, one seeks a feasible solution that optimizes the value of the objective function. Many combinatorial optimization problems are NP-hard. A way of coping with NP-hardness is by considering approximation algorithms.
openaire   +3 more sources

Home - About - Disclaimer - Privacy