Results 91 to 100 of about 828,043 (333)

Persistent Leukoencephalopathy Following H1N1 Infection Associated With a Novel MYRF Variant (p.Gly735Asp)

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Mutations in myelin regulatory factor (MYRF) are linked to demyelinating disorders. We report a 38‐year‐old male who developed acute symmetric leukoencephalopathy mimicking a stroke following an influenza A virus infection. While clinical symptoms markedly improved with corticosteroids, MRI revealed persistent white matter lesions, contrasting
Jinghan Hu   +5 more
wiley   +1 more source

Fast deconvolution method for angular super-resolution imaging based on sub-space embedding

open access: yesThe Journal of Engineering, 2019
This study presents a fast deconvolution method based on the sub-space embedding for angular super-resolution in radar forward-looking imaging area. The ill-posed character of convolution matrix causes the difficulty to improve angular resolution and the
Yang Wu   +3 more
doaj   +1 more source

Why Philosophers Should Care About Computational Complexity [PDF]

open access: yes, 2011
One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong.
Aaronson, Scott
core   +4 more sources

Association of Corticospinal Tract Asymmetry With Ambulatory Ability After Intracerebral Hemorrhage

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Ambulatory ability after intracerebral hemorrhage (ICH) is important to patients. We tested whether asymmetry between ipsi‐ and contra‐lesional corticospinal tracts (CSTs) assessed by diffusion tensor imaging (DTI) is associated with post‐ICH ambulation.
Yasmin N. Aziz   +25 more
wiley   +1 more source

Provable conditions in computational complexity theory [PDF]

open access: yesBulletin of the Australian Mathematical Society, 1985
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A new perspective on computational complexity theory in Membrane Computing [PDF]

open access: yes, 2019
A single Turing machine can solve decision problems with an in nite number of instances. On the other hand, in the framework of membrane computing, a \solution" to an abstract decision problem consists of a family of membrane systems (where each ...
Orellana Martín, David   +4 more
core  

Functional Connectivity Linked to Cognitive Recovery After Minor Stroke

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri   +7 more
wiley   +1 more source

Predicting Epileptogenic Tubers in Patients With Tuberous Sclerosis Complex Using a Fusion Model Integrating Lesion Network Mapping and Machine Learning

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Accurate localization of epileptogenic tubers (ETs) in patients with tuberous sclerosis complex (TSC) is essential but challenging, as these tubers lack distinct pathological or genetic markers to differentiate them from other cortical tubers.
Tinghong Liu   +11 more
wiley   +1 more source

A novel perturbation based compression complexity measure for networks

open access: yesHeliyon, 2019
Measuring complexity of brain networks in the form of integrated information is a leading approach towards building a fundamental theory of consciousness.
Mohit Virmani, Nithin Nagaraj
doaj   +1 more source

Turing's algorithmic lens: from computability to complexity theory

open access: yesArbor: Ciencia, Pensamiento y Cultura, 2013
[EN]: The decidability question, i.e., whether any mathematical statement could be computationally proven true or false, was raised by Hilbert and remained open until Turing answered it in the negative. Then, most efforts in theoretical computer science turned to complexity theory and the need to classify decidable problems according to their ...
Díaz Cort, Josep, Torras, Carme
openaire   +5 more sources

Home - About - Disclaimer - Privacy