factorization造句

factorization technique

Binary factorization compression and Consensus algorithm

The K_(1,k～-)-factorization of complete bipartite graphs;

By unique factorization, the ideal(f)is prime.

2-factorization of complete graph K_v and cycle colouring

Through the corresponding between integral coefficient polynomial and rational number, this paper obtains factorization from factorization of polynomial by the way of sieve in true fraction series.

Robust model-reference adaptive control using K_p=LDU factorization for multivariable discrete-time systems

A sufficient and necessary condition for the generalized Moore-Penrose inverse of a factorization matrix

Methods A simple method for distinguishing of exponential distribution family is obtained based on factorization theorem.

Application of non-negative matrix factorization in discrimination of Houttuynia cordata near infrared spectroscopy

VB Math Example: prime factorization source code, there is need for the next.

An improved implicit approximate factorization algorithm for the generation of body-fitted curvilinear coordinate systems has been developed.

Results a factorization discriminance of exponential distribution family was obtained, moreover good properties of exponential distribution family were established.

The factorization of adjoint polynomials of a class of graphs S_(k(rm+1)+1)~(S*(1))

Inspired by the nonnegative matrix factorization algorithm, we put forward an fuzzy text clustering method based on nonnegative factor analysis.

The factorization method for three-dimensional oscillator to show the method for formula match and recurrence relation in CA;

A real factorization method based on evolutionary algorithms is proposed for finding tbe roots of the characteristic equation of a linear time-invariant closed-loop system.

It is mainly to some simple matrices to the research of the fast triangular factorization algorithms of special matrices up to now.

It can avoid approximate factorization or block-bidiagonal matrix, and has obvious superiority in enhancing accuracy, lessening amount of calculation, improving stability.

In this paper, two schemes for digital signature with message recovery are presented. The security of these schemes is based on factorization and discrete logarithms.

An implicit approximate factorization scheme (AF2) is employed in this paper to obtain the numerical solutions of TSD and TSTD equation.

Its (security) is based on the intractability of the integer factorization problem as RSA, and it is able to resist the chosen-ciphertext attack against RSA and easy to be implemented.

Notice that constructing the ARMA innovation model, a left co-prime factorization to a polynomial matrix must be performed, so that the ARMA innovation model can correctly be obtained.