Sentence examples for the computation uses from inspiring English sources

When the DCT length p is such that (p−1)/2 is odd, the computation uses two (p−1)/2 point cyclic convolutions.

The computation uses the fast Fourier transform based on (10) where the continuous integral turns into a discrete summation over N values, with an index from -H to +H.

Unfortunately, this CDF is hard to compute, so we ease the computation using [[39], Lemma 3], which was also used in [[11], Appendix III].

It took us 312.9 hours to finish the computation using the naïve method and only 6.5 hours for MinSup = 1,000 (or 36.4 hours for MinSup = 200) using Algorithm 1.

We conducted the computation using differential viscosities with a depth interval of 40 km.

This communication is handled in parallel to the computation using Direct Memory Access (DMA) modules.

The methods developed in the spectral domain are meant to speedup the computation using the FFT algorithm proposed with optimized implementation in signal/image processing libraries [12].

Energy required for the computation using uniform frequency is: E uniform = f uniform 3 + ( N − 1 ) × T p × f uniform 3 (6).

The approximation introduced by finite-precision representation of continuous data can induce arbitrarily large information leaks even when the computation using exact semantics is secure.

However, the computation using 5 by 5 neighbours is a little costive.

IC-MEP can dramatically speed up the computation using more processors (about 6 min with 48 processors), while using only 1 GB of memory in each processor.