Results 51 to 60 of about 381,752 (282)
A complex analogue of Toda's Theorem [PDF]
Toda \cite{Toda} proved in 1989 that the (discrete) polynomial time hierarchy, $\mathbf{PH}$, is contained in the class $\mathbf{P}^{#\mathbf{P}}$, namely the class of languages that can be decided by a Turing machine in polynomial time given access to ...
Basu, Saugata
core +3 more sources
A Two‐Stage Questionnaire and Actigraphy Screening for iRBD in a Multicenter Retrospective Cohort
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
The hardness of decoding linear codes with preprocessing [PDF]
The problem of maximum-likelihood decoding of linear block codes is known to be hard. The fact that the problem remains hard even if the code is known in advance, and can be preprocessed for as long as desired in order to device a decoding algorithm, is ...
Bruck, Jehoshua, Naor, Moni
core +1 more source
Objective Obesity, defined by body mass index (BMI) ≥30 kg/m2, is a risk factor for functional limitations in people with knee osteoarthritis (OA). However, function varies among such individuals. Our objective was to evaluate the implications of obesity subtypes on longitudinal patterns of physical functioning in people with or at risk for knee OA ...
Kristine Godziuk +7 more
wiley +1 more source
Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem
In this paper a primal-dual path-following interior-point algorithm for the monotone semidefinite linear complementarity problem is presented.
Mohamed Achache, Naima Boudiaf
doaj +2 more sources
Efficient Digital Predistortion Using Sparse Neural Network
This paper proposes an efficient neural-network-based digital predistortion (DPD), named as envelope time-delay neural network (ETDNN) DPD. The method complies with the physical characteristics of radio-frequency (RF) power amplifiers (PAs) and uses a ...
Masaaki Tanio +2 more
doaj +1 more source
On computational complexity of Siegel Julia sets
It has been previously shown by two of the authors that some polynomial Julia sets are algorithmically impossible to draw with arbitrary magnification.
Binder, I., Braverman, M., Yampolsky, M.
core +1 more source
Discordance Between Patient and Physician Global Assessments in Early Systemic Sclerosis
Objective This study aims to identify factors associated with patient global assessment (PtGA) and physician global assessment (PhGA) and discordance between them in systemic sclerosis (SSc). Methods Data from adults with early SSc (<5 years) from the Collaborative National Quality and Efficacy Registry were included.
Ellen Romich +35 more
wiley +1 more source
A Robust Adaptive One‐Sample‐Ahead Preview Super‐Twisting Sliding Mode Controller
Block Diagram of the Robust Adaptive One‐Sample‐Ahead Preview Super‐Twisting Sliding Mode Controller. ABSTRACT This article introduces a discrete‐time robust adaptive one‐sample‐ahead preview super‐twisting sliding mode controller. A stability analysis of the controller by Lyapunov criteria is developed to demonstrate its robustness in handling both ...
Guilherme Vieira Hollweg +5 more
wiley +1 more source
Improving the smoothed complexity of FLIP for max cut problems
Finding locally optimal solutions for max-cut and max-$k$-cut are well-known PLS-complete problems. An instinctive approach to finding such a locally optimum solution is the FLIP method. Even though FLIP requires exponential time in worst-case instances,
Bibak, Ali +2 more
core +1 more source

