Results 11 to 20 of about 1,945,411 (275)

Quantum error detection .II. Bounds [PDF]

open access: yesIEEE Transactions on Information Theory, 2000
In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower (existence) bound for stabilizer codes is proved by a counting argument for classical self-orthogonal quaternary codes.
Ashikhmin, Alexei E.   +3 more
openaire   +2 more sources

Optimal Recovery of Missing Values for Non-Negative Matrix Factorization

open access: yesIEEE Open Journal of Signal Processing, 2021
Missing values imputation is often evaluated on some similarity measure between actual and imputed data. However, it may be more meaningful to evaluate downstream algorithm performance after imputation than the imputation itself.
Rebecca Chen Dean, Lav R. Varshney
doaj   +1 more source

Error Bounds for Dynamical Spectral Estimation [PDF]

open access: yesSIAM Journal on Mathematics of Data Science, 2021
34 pages, 7 ...
Robert J. Webber   +4 more
openaire   +4 more sources

An Investigation on Existence, Uniqueness, and Approximate Solutions for Two-Dimensional Nonlinear Fractional Integro-Differential Equations

open access: yesMathematics, 2023
In this research, we provide sufficient conditions to prove the existence of local and global solutions for the general two-dimensional nonlinear fractional integro-differential equations. Furthermore, we prove that these solutions are unique.
Tahereh Eftekhari, Jalil Rashidinia
doaj   +1 more source

A Novel Numerical Method for Computing Subdivision Depth of Quaternary Schemes

open access: yesMathematics, 2021
In this paper, an advanced computational technique has been presented to compute the error bounds and subdivision depth of quaternary subdivision schemes.
Aamir Shahzad   +5 more
doaj   +1 more source

Dynamic Orthogonal Matching Pursuit for Sparse Data Reconstruction

open access: yesIEEE Open Journal of Signal Processing, 2023
The orthogonal matching pursuit (OMP) is one of the mainstream algorithms for sparse data reconstruction or approximation. It acts as a driving force for the development of several other greedy methods for sparse data reconstruction, and it also plays a ...
Yun-Bin Zhao, Zhi-Quan Luo
doaj   +1 more source

Recovery-Based Error Estimator for Natural Convection Equations Based on Defect-Correction Methods

open access: yesEntropy, 2022
In this paper, we propose an adaptive defect-correction method for natural convection (NC) equations. A defect-correction method (DCM) is proposed for solving NC equations to overcome the convection dominance problem caused by a high Rayleigh number.
Lulu Li, Haiyan Su, Xinlong Feng
doaj   +1 more source

Street-Level Landmark Evaluation With Upper Error Bound

open access: yesIEEE Access, 2019
Street-level landmarks are the basis of high-precision IP geolocation, and the location-error of landmark affects the accuracy of geolocation result. However, existing landmark evaluation methods cannot determine the error range of landmarks.
Wen Yang, Xiaonan Liu, Meijuan Yin
doaj   +1 more source

Development of an Improved Frequency Limited Model Order Reduction Technique and Error Bound for Discrete-Time Systems [PDF]

open access: yesRadioengineering, 2021
Frequency limited model order reduction algorithm presented by Wang and Zilouchian for discrete-time systems provide unstable reduced-order models and also do not provide a priori error bound formula.
S. Batool   +5 more
doaj  

Decoding Cyclic Codes up to a New Bound on the Minimum Distance [PDF]

open access: yes, 2012
A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special cases of our bound.
Bezzateev, Sergey   +2 more
core   +2 more sources

Home - About - Disclaimer - Privacy