Results 251 to 260 of about 165,252 (290)
A Faster Privacy-Preserving Medical Image Diagnosis Scheme with Machine Learning. [PDF]
J Imaging Inform MedRan J, Li D.
europepmc +1 more source
Efficient face information encryption and verification scheme based on full homomorphic encryption. [PDF]
Sci RepChen Y +7 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Polynomial and Multiplicative Radicals
Quaestiones Mathematicae, 2003We show that polynomial and multiplicative radicals in [1] are special cases of radicals defined by means of elements. We scrutinize the way of defining a radical γG by a subset G of polynomials in noncommuting indeterminates. Defining polynomial radicals, Drazin and Roberts [1] required that the set G be closed under composition of polynomials ...
Tumurbat, S., Wiegandt, R.
openaire +2 more sources
On Multiplication of Polynomials Modulo a Polynomial
SIAM Journal on Computing, 1980The multiplicative complexity of the direct product of algebras $A_p $ of polynomials modulo a polynomial P is studied. In particular, we show that if P and Q are irreducible polynomials then the multiplicative complexity of $A_{\text{P}} \times A_{\text{Q}} $ is $2\deg ({\text{P}})\deg ({\text{Q}}) - {\text{k}}$, where k is the number of factors of P ...
openaire +2 more sources
Bivariate polynomial multiplication
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), 2002We study the multiplicative complexity and the rank of the multiplication in the local algebras R/sub m,n/=k[x,y]/(x/sup m+1/,y/sup n+1/) and T/sub n/=k[x,y]/(x/sup n+1/,x/sup n/y,...,y/sup n+1/) of bivariate polynomials. We obtain the lower bounds (21/3-0(1))/spl middot/dim R/sub m,n/, and (2 1/2 -0(1))/spl middot/dim T/sub n/ for the multiplicative ...
openaire +1 more source
New Algorithms for Polynomial Multiplication
SIAM Journal on Computing, 1979Exploiting the structure of the 2-dimensional sorting problem associated with the polynomial product has been the strategy in the design of certain algorithms which are faster for a large class of problems than those found in the literature. First a parallel is drawn between GEN–MULT and Horowitz’s SORT–MULT algorithm [A sorting algorithm for ...
openaire +1 more source
Polynomials over multiplicative hyperrings
Journal of Discrete Mathematical Sciences and Cryptography, 2003Abstract We build a polynomials multiplicative hyperring over a multiplicative hyperring A and identify properties of A which are necessary for this construction.
ROTA, Rosaria, PROCESI R.
openaire +2 more sources
Constrained Polynomial Multiplication
1988Frequently, one or both of the polynomials to be multiplied has some special characteristic, such as symmetry in the coefficients, coefficients that are zero or in G, or some other possibility. What are the effects of input constraints on the multiplicative complexity of systems of polynomial multiplication?
openaire +1 more source
Multiple Comparisons of Polynomial Distributions
Biometrical Journal, 1984AbstractAsymptotically correct 90 and 95 percentage points are given for multiple comparisons with control and for all pair comparisons of several independent samples of equal size from polynomial distributions. Test statistics are the maxima of the X2‐statistics for single comparisons. For only two categories the asymptotic distributions of these test
openaire +2 more sources
Integer and polynomial multiplication
Proceedings of the 2007 international symposium on Symbolic and algebraic computation, 2007Karatsuba and Toom-Cook are well-known methods used to multiply efficiently long integers. There have been different proposal about the interpolating values used to determine the matrix to be inverted and the sequence of operations to invert it. A deffinitive word about which is the optimal matrix (values) and the (number of) basic operations to invert
Marco Bodrato, Alberto Zanoni
openaire +1 more source