Results 41 to 50 of about 2,555,427 (286)

Robust Polynomials and Quantum Algorithms [PDF]

Theory of Computing Systems, 2005
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We compare several different possible definitions. Our main results are * For every n-bit Boolean function f there is an n-variate polynomial p of degree O(n) that robustly ...
Buhrman, H.M., Newman, I., Röhrig, H.P., de Wolf, R.M.   +3 more
openaire   +7 more sources

CSF Cytokine Network Organization Predicts Progression Independent of Relapse and MRI Activity in Multiple Sclerosis

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Progression independent of relapse activity is a major determinant of long‐term disability in multiple sclerosis, but its immunopathologic basis remains incompletely understood. We investigated whether relapse‐independent progression in radiologically stable relapsing–remitting multiple sclerosis is associated with distinct ...
Antonio Bruno, Matteo Conti, Ettore Dolcetti, Federica Azzolini, Angela Borrelli, Roberta Fantozzi, Mario Stampanoni Bassi, Giovanni Galifi, Giuseppe Maccarrone, Luca Montaguti, Marco Cervigni, Maddalena Dal Pozzo, Roberto Furlan, Annamaria Finardi, Girolama Alessandra Marfia, Marco Salvetti, Antonella Conte, Fabio Buttari, Diego Centonze, Luana Gilio   +19 more
wiley   +1 more source

Accurate Evaluation of Polynomials in Legendre Basis

Journal of Applied Mathematics, 2014
This paper presents a compensated algorithm for accurate evaluation of a polynomial in Legendre basis. Since the coefficients of the evaluated polynomial are fractions, we propose to store these coefficients in two floating point numbers, such as double ...
Peibing Du, Hao Jiang, Lizhi Cheng
doaj   +1 more source

Polynomial Poisson algebras: Gel'fand-Kirillov problem and Poisson spectra [PDF]

, 2014
We study the fields of fractions and the Poisson spectra of polynomial Poisson algebras. First we investigate a Poisson birational equivalence problem for polynomial Poisson algebras over a field of arbitrary characteristic.
Lecoutre, César
core  

Data‐Driven SuStaIn Model of Disability Progression in Amyotrophic Lateral Sclerosis

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To determine whether ordinal Subtype and Stage Inference (SuStaIn) applied to routine ALSFRS‐R item scores can identify reproducible disability progression patterns in amyotrophic lateral sclerosis (ALS) and provide clinically meaningful staging.
Giammarco Milella, Veria Vacchiano, Vittorio Velucci, Stefano Zoccolella, Rocco Liguori, Giovanni Defazio   +5 more
wiley   +1 more source

An Improved Multi-Objective Trajectory Planning Algorithm for Kiwifruit Harvesting Manipulator

IEEE Access, 2023
Trajectory planning is always a hot issue for harvesting manipulators, considering the limitations of the manipulator mechanical structure and other nonlinear factors that result in long time, big jerk and high energy consumption of the manipulator in ...
Xiao Li, Hailin Lv, Detian Zeng, Qi Zhang   +3 more
doaj   +1 more source

dynoGP: Deep Gaussian Processes for Dynamic System Identification

International Journal of Adaptive Control and Signal Processing, EarlyView.
This work introduces a novel class of deep models for system identification, dynamical deep Gaussian processes, which combine the strengths of data‐driven methods, such as those based on neural network architectures, with the ability to output a probability distribution for uncertainty representation.
Alessio Benavoli, Marco Forgione, Dario Piga, Marco Zaffalon   +3 more
wiley   +1 more source

Parametric Polynomial Time Perceptron Rescaling Algorithm

, 2006
Let us consider a linear feasibility problem with a possibly infinite number of inequality constraints posed in an on-line setting: an algorithm suggests a candidate solution, and the oracle either confirms its feasibility, or outputs a violated ...
Kharechko, Andriy
core   +1 more source

Bus Scheduling as a Graph Coloring Problem

Communications, 2003
The fundamental vehicle-scheduling problem (VSP) is usually formulated as a matching problem for which there exists a polynomial algorithm. The formulation of VSP as a graph coloring problem may seem not to be practical since a graph coloring problem is ...
Stanislav Paluch
doaj   +1 more source

Square-rich fixed point polynomial evaluation on FPGAs [PDF]

, 2014
Polynomial evaluation is important across a wide range of application domains, so significant work has been done on accelerating its computation. The conventional algorithm, referred to as Horner's rule, involves the least number of steps but can lead to
McLoughlin, Ian V., Suhaib A. Fahmy, Xu, Simin, Fahmy, Suhaib A., Ian V. McLoughlin, Simin Xu   +5 more
core   +1 more source