Results 41 to 50 of about 94,123 (313)
Polynomial-Division-Based Algorithms for Computing Linear Recurrence Relations [PDF]
, 2022 International audienceSparse polynomial interpolation, sparse linear system solving or modular rational reconstruction are fundamental problems in Computer Algebra.
Faugère, Jean-Charles +1 more
core +2 more sources
Parametric Polynomial Time Perceptron Rescaling Algorithm [PDF]
, 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
A Signature-based Algorithm for Computing the Nondegenerate Locus of a Polynomial System [PDF]
, 2022 Polynomial system solving arises in many application areas to model non-linear geometric properties. In such settings, polynomial systems may come with degeneration which the end-user wants to exclude from the solution set.
Christian Eder +8 more
core +2 more sources
FEBS Letters, EarlyView.The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson +6 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
A Two‐Stage Questionnaire and Actigraphy Screening for iRBD in a Multicenter Retrospective Cohort
Annals of Clinical and Translational Neurology, EarlyView.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
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
Toward efficacy of piecewise polynomial truncated singular value decomposition algorithm in moving force identification [PDF]
, 2019 This paper introduces and evaluates the piecewise polynomial truncated singular value decomposition (PP-TSVD) algorithm toward an effective use for moving force identification (MFI).
Zhao, Shunbo +4 more
core +1 more source
Advanced Engineering Materials, EarlyView.Predicting extreme defects in additive manufacturing remains a key challenge limiting its structural reliability. This study proposes a statistical framework that integrates Extreme Value Theory with advanced process indicators to explore defect–process relationships and improve the estimation of critical defect sizes. The approach provides a basis for
Muhammad Muteeb Butt +8 more
wiley +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