Results 291 to 300 of about 4,479,797 (370)
Some of the next articles are maybe not open access.
Seamless GPS/Inertial Navigation System Based on Self-Learning Square-Root Cubature Kalman Filter
IEEE transactions on industrial electronics (1982. Print), 2021To improve the seamless navigation ability of an integrated Global Positioning System (GPS)/inertial navigation system in GPS-denied environments, a hybrid navigation strategy called the self-learning square-root- cubature Kalman filter (SL-SRCKF) is ...
Chong Shen +7 more
semanticscholar +1 more source
IEEE Annual Symposium on Foundations of Computer Science, 2020
Constructing quantum LDPC codes with a minimum distance that grows faster than a square root of the length has been a major challenge of the field. With this challenge in mind, we investigate constructions that come from high-dimensional expanders, in ...
Shai Evra, T. Kaufman, G. Zémor
semanticscholar +1 more source
Constructing quantum LDPC codes with a minimum distance that grows faster than a square root of the length has been a major challenge of the field. With this challenge in mind, we investigate constructions that come from high-dimensional expanders, in ...
Shai Evra, T. Kaufman, G. Zémor
semanticscholar +1 more source
Root Mean Square Layer Normalization
Neural Information Processing Systems, 2019Layer normalization (LayerNorm) has been successfully applied to various deep neural networks to help stabilize training and boost model convergence because of its capability in handling re-centering and re-scaling of both inputs and weight matrix ...
Biao Zhang, Rico Sennrich
semanticscholar +1 more source
Low Latency Floating-Point Division and Square Root Unit
IEEE transactions on computers, 2020Digit-recurrence algorithms are widely used in actual microprocessors to compute floating-point division and square root. These iterative algorithms present a good trade-off in terms of performance, area and power.
J. Bruguera
semanticscholar +1 more source
IEEE Transactions on Computers, 1990
A general discussion on nonrestoring square root algorithms is presented, showing bounds and constraints delimiting the space of feasible algorithms, for all the choices of radix, digit set and representation of the partial remainder. Two classes of algorithms are then derived from the general discussion, and it is shown how it is possible to determine
CIMINIERA, Luigi, MONTUSCHI, PAOLO
openaire +2 more sources
A general discussion on nonrestoring square root algorithms is presented, showing bounds and constraints delimiting the space of feasible algorithms, for all the choices of radix, digit set and representation of the partial remainder. Two classes of algorithms are then derived from the general discussion, and it is shown how it is possible to determine
CIMINIERA, Luigi, MONTUSCHI, PAOLO
openaire +2 more sources
Review of Scientific Instruments, 1940
A mechanical device is described for extracting a root or obtaining a power of successive ordinate values of curves. It is particularly useful in calculating the total volume flow in a pulsating stream from velocity (or rate of flow) records obtained from venturimeters, orifice meters or Pitot tube meters in which the deflection of the record is ...
openaire +2 more sources
A mechanical device is described for extracting a root or obtaining a power of successive ordinate values of curves. It is particularly useful in calculating the total volume flow in a pulsating stream from velocity (or rate of flow) records obtained from venturimeters, orifice meters or Pitot tube meters in which the deflection of the record is ...
openaire +2 more sources
IEEE Transactions on Electronic Computers, 1965
Binary square rooting algorithms which yield a root in a redundant representation using digits 1, ?1, and 0 are analyzed, particularly those yielding a root in a representation in which the number of nonzero digits is minimal. An algorithm which may lead to any possible minimal representation of the square root is developed.
openaire +1 more source
Binary square rooting algorithms which yield a root in a redundant representation using digits 1, ?1, and 0 are analyzed, particularly those yielding a root in a representation in which the number of nonzero digits is minimal. An algorithm which may lead to any possible minimal representation of the square root is developed.
openaire +1 more source
The Arithmetic Teacher, 1969
Most modern mathematics textbooks favor the approximation method for computing square roots. The so-called long division method is not often mentioned. The approximation method is sound in principle, and it finds favor with many students because of the logic of its continuing process.
openaire +1 more source
Most modern mathematics textbooks favor the approximation method for computing square roots. The so-called long division method is not often mentioned. The approximation method is sound in principle, and it finds favor with many students because of the logic of its continuing process.
openaire +1 more source