Results 31 to 40 of about 3,246,226 (345)
New results on multidimensional Chinese remainder theorem [PDF]
, 1994 The Chinese remainder theorem (CRT) [McClellan and Rader 1979] has been well known for applications in fast DFT computations and computer arithmetic.
Lin, Yuan-Pei +2 more
core +1 more source
On computation rates for arithmetic sum
2016 IEEE International Symposium on Information Theory (ISIT), 2016 For zero-error function computation over directed acyclic networks, existing upper and lower bounds on the computation capacity are known to be loose. In this work we consider the problem of computing the arithmetic sum over a specific directed acyclic network that is not a tree. We assume the sources to be i.i.d. Bernoulli with parameter $1/2$.
Ardhendu Tripathy, Aditya Ramamoorthy
openaire +5 more sources
Region-Based Fractional Wavelet Transform Using Post Processing Artifact Reduction [PDF]
Iraqi Journal for Electrical and Electronic Engineering, 2010 Wavelet-based algorithms are increasingly used in the source coding of remote sensing, satellite and other geospatial imagery. At the same time, wavelet-based coding applications are also increased in robust communication and network transmission of ...
Jassim M. Abdul-Jabbar +1 more
doaj
About finding of prime numbers that follow after given prime number without using computer
Дифференциальная геометрия многообразий фигур, 2020 It is shown how to define one or several prime numbers following after given prime number without using computer only by calculating several arithmetic progressions. Five examples of finding such prime numbers are given.
V.S. Malakhovsky
doaj +1 more source
IMPLEMENTATION OF THE ARITHMETIC ADDITION OPERATION IN THE SYSTEM OF RESIDUAL CLASSES
Сучасні інформаційні системи, 2020 The subject of the article is the development of a method for implementing the arithmetic operation of addition numbers that are represented in the system of residual classes (SRC). This method is based on the use of the principle of circular shift (PCS).
Victor Krasnobayev +2 more
doaj +1 more source
Minimizing CNOT-count in quantum circuit of the extended Shor’s algorithm for ECDLP
Cybersecurity, 2023 The elliptic curve discrete logarithm problem (ECDLP) is a popular choice for cryptosystems due to its high level of security. However, with the advent of the extended Shor’s algorithm, there is concern that ECDLP may soon be vulnerable.
Xia Liu, Huan Yang, Li Yang
doaj +1 more source
Journal of Numerical Cognition, 2022 Exact arithmetic abilities require symbolic numerals, which constitute a precise representation of quantities, such as the Arabic digits. Numerical thinking, however, also engages an intuitive non-linguistic number sense, the Approximate Number System ...
Nuria Ferres-Forga +3 more
doaj +1 more source
Certified lattice reduction [PDF]
, 2019 Quadratic form reduction and lattice reduction are fundamental tools in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra-Lenstra-Lov\'asz reduction algorithm (so-called LLL) has been improved in many
Espitau, Thomas, Joux, Antoine
core +5 more sources
An Informal Arithmetical Approach to Computability and Computation, III [PDF]
Canadian Mathematical Bulletin, 1961 It is assumed that the reader is acquainted with the first two parts of the present paper, [1] and [2], in which there was developed informally the theory of a certain class of hypothetical computing devices, the Q-machines. In the present part of the paper we develop a way of describing Q-programs and Q-computations; then, following the theorem in [2],
openaire +3 more sources
An algorithmic and architectural study on Montgomery exponentiation in RNS [PDF]
, 2012 The modular exponentiation on large numbers is computationally intensive. An effective way for performing this operation consists in using Montgomery exponentiation in the Residue Number System (RNS).
Bajard, J.C. +4 more
core +3 more sources