Results 101 to 110 of about 828,043 (333)
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Introduction Progressive Supranuclear Palsy (PSP) is a neurodegenerative ‘tauopathy’ with predominating pathology in the basal ganglia and midbrain. Caudal tau spread frequently implicates the cerebellum; however, the pattern of atrophy remains equivocal.
Chloe Spiegel +8 more
wiley +1 more source
Sensors, 2018 In estimating the two-dimensional (2D) direction-of-arrival (DOA) using a coprime planar array, the main issues are the high complexity of spectral peak search and the limited degree of freedom imposed by the number of sensors.
Haiyun Xu +4 more
doaj +1 more source
Parametrised second-order complexity theory with applications to the study of interval computation [PDF]
, 2019 Eike Neumann, Florian Steinberg
openalex +1 more source
Sum-of-squares proofs and the quest toward optimal algorithms [PDF]
, 2014 In order to obtain the best-known guarantees, algorithms are traditionally tailored to the particular problem we want to solve. Two recent developments, the Unique Games Conjecture (UGC) and the Sum-of-Squares (SOS) method, surprisingly suggest that this
Barak, Boaz, Steurer, David
core +1 more source
A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems
International Journal of Adaptive Control and Signal Processing, Volume 39, Issue 3, Page 566-581, March 2025.A Q‐learning algorithm to solve the two‐player zero‐sum game problem for nonlinear systems. ABSTRACT This paper deals with the two‐player zero‐sum game problem, which is a bounded L2$$ {L}_2 $$‐gain robust control problem. Finding an analytical solution to the complex Hamilton‐Jacobi‐Issacs (HJI) equation is a challenging task.
Afreen Islam +2 more
wiley +1 more source
Theories with self-application and computational complexity
Information and Computation, 2003 The author gives a very elegant and uniform characterization of various complexity classes -- namely FPtime, FPtimeLinspace, FPspace, and FLinspace -- in the context of Feferman's explicit mathematics [``Constructive theories of functions and classes'', Logic colloquium '78, Stud. Logic Found. Math. 97, 159--224 (1979; Zbl 0441.03022)]. It makes use of
openaire +2 more sources
Arithmetic theories for computational complexity problems
Information and Control, 1986 Ein Ansatz zum genaueren Verständnis der Hierarchie von Komplexitätsklassen besteht darin, eine ''Übersetzung'' der komplexitätstheoretischen Probleme in entsprechende logische Probleme zu finden. Die Autoren verallgemeinern eine solche Konstruktion von R. A. DeMillo und R. J. Lipton (1979) und geben eine Reihe von Anwendungen an.
Homer, Steve, Reif, John
openaire +1 more source
Current Tracking Adaptive Control of Brushless DC Motors
International Journal of Adaptive Control and Signal Processing, EarlyView.In this paper, the current tracking for Brushless Direct Current motors is approached considering uncertainty in the parameters of the motor's model. An adaptive control scheme to compensate electrical parameters uncertainty is proposed without requiring any knowledge of the mechanical parameters.
Fernanda Ramos‐García +3 more
wiley +1 more source
Time-memory trade-offs for index calculus in genus 3
Journal of Mathematical Cryptology, 2015 In this paper, we present a variant of Diem's O˜(q)${\widetilde{O}(q)}$ index calculus algorithm to attack the discrete logarithm problem (DLP) in Jacobians of genus 3 non-hyperelliptic curves over a finite field 𝔽q.
Laine Kim, Lauter Kristin
doaj +1 more source
Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry [PDF]
, 2021 Karl Bringmann
openalex +1 more source