Results 21 to 30 of about 249,312 (242)
Binary Codes Based on Non-Negative Matrix Factorization for Clustering and Retrieval
Traditional non-negative matrix factorization methods cannot learn the subspace from the high-dimensional data space composed of binary codes. One hopes to discover a compact parts-based representation composed of binary codes, which can uncover the ...
Jiang Xiong +3 more
doaj +1 more source
Scalable set of reversible parity gates for integer factorization
Classical microprocessors operate on irreversible gates, that, when combined with AND, half-adder and full-adder operations, execute complex tasks such as multiplication of integers.
Martin Lanthaler +2 more
doaj +1 more source
SOME RESULTS ON ORDERED AND UNORDERED FACTORIZATION OF A POSITIVE INTEGER [PDF]
A well-known enumerative problem is to count the number of ways a positive integer $n$ can be factorised as $n=n_1\times n_2\times\cdots\times n_{k}$, where $n_1\geqslant n_2 \geqslant \cdots \geqslant n_{k} >1$.
Daniel Yaqubi, Madjid Mirzavaziri
doaj +1 more source
On the factorization of squarefree integers [PDF]
In recent years several papers [1; 3; 4; 5; 6; 7; 9; 10; 11] have appeared dealing with the problem of "Factorisatio numerorum," the number f(n) of representations of an integer n as an ordered product of factors greater than 1. As a result, the basic combinatorial properties of f(n) and the asymptotic behavior of its summatory function are well known.
openaire +1 more source
Prime factors of consecutive integers [PDF]
This note contains a new algorithm for computing a function f ( k ) f(k)
Mark Bauer, Michael A. Bennett
openaire +2 more sources
INTEGER FACTORIZATION IMPLEMENTATIONS [PDF]
One difficult problem of mathematics that forms the basics of some public key cryptography systems like RSA, is finding factors of big numbers. To solve this problem, many factorization algorithms have been offered with different complexities.
Reza Alimoradi, Hamid Reza Arkian
doaj
Directional clustering through matrix factorization [PDF]
This paper deals with a clustering problem where feature vectors are clustered depending on the angle between feature vectors, that is, feature vectors are grouped together if they point roughly in the same direction.
Blumensath, Thomas
core +1 more source
On factoring of unlimited integers
Abdelmadjid Boudaoud asked whether every unlimited integer is a sum of a limited integer and a product of two unlimited integers. Assuming Dickson's conjecture, the answer is negative.
openaire +4 more sources
Factorization of big integer and the security of RSA
Three kinds of methods for integer factorization were proposed and the security of RSA was demarcated.RSA is a well-known cryptographic algorithm,using the analysis result of those methods.Through the work,readers could easily realize that if merely ...
Yan-bing REN
doaj +3 more sources
Integer factoring and compositeness witnesses [PDF]
Abstract We describe a reduction of the problem of factorization of integers n ≤ x in polynomial-time (log x ) M +
Jacek Pomykala, Maciej Radziejewski
openaire +5 more sources

