Results 1 to 10 of about 3,027,533 (330)

Morgan-Voyce Polynomial Approach for Quaternionic Space Curves of Constant Width [PDF]

open access: diamondFoundations of Computing and Decision Sciences, 2021
The curves of constant width are special curves used in engineering, architecture and technology. In the literature, these curves are considered according to different roofs in different spaces and some integral characterizations of these curves are ...
Tuba AĞIRMAN AYDIN   +2 more
openalex   +2 more sources

Unconditional advantage of noisy qudit quantum circuits over biased threshold circuits in constant depth. [PDF]

open access: yesNat Commun
The rapid evolution of quantum devices fuels concerted efforts to experimentally establish quantum advantage over classical computing. Many demonstrations of quantum advantage, however, rely on computational assumptions and face verification challenges ...
de Oliveira M   +3 more
europepmc   +2 more sources

On the Best Constant in the Error Bound for theH10-Projection into Piecewise Polynomial Spaces

open access: bronze, 1998
Explicita priorierror bounds for the approximation by theH10-projection into piecewise polynomial spaces are given. In particular, for the quadratic approximation, the optimal constant is derived, and a nearly optimal value for the cubic is obtained ...
Mitsuhiro T. Nakao   +2 more
openalex   +2 more sources

Convergence for score-based generative modeling with polynomial complexity [PDF]

open access: yesNeural Information Processing Systems, 2022
Score-based generative modeling (SGM) is a highly successful approach for learning a probability distribution from data and generating further samples. We prove the first polynomial convergence guarantees for the core mechanic behind SGM: drawing samples
Holden Lee, Jianfeng Lu, Yixin Tan
semanticscholar   +1 more source

Exploiting Constant Trace Property in Large-scale Polynomial Optimization [PDF]

open access: yesACM Transactions on Mathematical Software, 2020
We prove that every semidefinite moment relaxation of a polynomial optimization problem (POP) with a ball constraint can be reformulated as a semidefinite program involving a matrix with constant trace property (CTP). As a result, such moment relaxations
N. Mai   +3 more
semanticscholar   +1 more source

Is Catalan’s Constant Rational?

open access: yesMathematics, 2022
This paper employs a contour integral method to derive and evaluate the infinite sum of the Euler polynomial expressed in terms of the Hurwitz Zeta function. We provide formulae for several classes of infinite sums of the Euler polynomial in terms of the
Robert Reynolds, Allan Stauffer
doaj   +1 more source

Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-Polynomial Time [PDF]

open access: yesIEEE Annual Symposium on Foundations of Computer Science, 2018
In the weighted flow-time problem on a single machine, we are given a set of n jobs, where each job has a processing requirement p_j, release date r_j and weight w_j. The goal is to find a preemptive schedule which minimizes the sum of weighted flow-time
Jatin Batra, Naveen Garg, Amit Kumar
semanticscholar   +1 more source

A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time [PDF]

open access: yesACM-SIAM Symposium on Discrete Algorithms, 2018
We consider the classic scheduling problem of minimizing the total weighted flow-time on a single machine (min-WPFT), when preemption is allowed. In this problem, we are given a set of n jobs, each job having a release time rj, a processing time pj, and ...
U. Feige, Janardhan Kulkarni, Shi Li
semanticscholar   +1 more source

Upper Bound for Lebesgue Constant of Bivariate Lagrange Interpolation Polynomial on the Second Kind Chebyshev Points

open access: yesJournal of Mathematics, 2022
In the paper, we study the upper bound estimation of the Lebesgue constant of the bivariate Lagrange interpolation polynomial based on the common zeros of product Chebyshev polynomials of the second kind on the square −1,12. And, we prove that the growth
Juan Liu, Laiyi Zhu
doaj   +1 more source

“SPOCU”: scaled polynomial constant unit activation function

open access: yesNeural computing & applications (Print), 2020
We address the following problem: given a set of complex images or a large database, the numerical and computational complexity and quality of approximation for neural network may drastically differ from one activation function to another.
J. Kiselák   +4 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy