| /external/ImageMagick/utilities/ |
| convert.1.in | 295 \-poly terms build a polynomial from the image sequence and the corresponding terms (coefficients and degree pairs)
|
| /external/ImageMagick/www/api/ |
| statistic.html | 422 <dd>the list of polynomial coefficients and degree pairs and a constant. </dd>
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/ |
| BicubicSplineInterpolatingFunction.java | 410 * Compute the value of the bicubic polynomial.
|
| /external/boringssl/src/crypto/modes/asm/ |
| ghashv8-armx.pl | 10 # GHASH for ARMv8 Crypto Extension, 64-bit polynomial multiplication.
|
| /external/ceres-solver/examples/ |
| nist.cc | 104 "Degree of polynomial aproximation in line search, "
|
| /external/ipsec-tools/src/racoon/ |
| strnames.c | 641 { OAKLEY_ATTR_GRP_PI, "Group Prime/Irreducible Polynomial", NULL },
|
| /external/libogg/doc/ |
| framing.html | 364 generator polynomial=0x04c11db7). The value is computed over the
|
| /external/libvorbis/doc/ |
| framing.html | 364 generator polynomial=0x04c11db7). The value is computed over the
|
| /external/llvm/include/llvm/IR/ |
| IntrinsicsAArch64.td | 208 // 64-bit polynomial multiply really returns an i128, which is not legal. Fake
|
| /external/opencv3/modules/core/include/opencv2/core/ |
| optim.hpp | 279 any problem written as above in polynomial time, while simplex method degenerates to exponential
|
| /external/sonivox/arm-wt-22k/lib_src/ |
| eas_math.h | 50 order polynomial, instead of taking the coefficients from
|
| /frameworks/av/media/libeffects/testlibs/ |
| EffectsMath.h | 40 order polynomial, instead of taking the coefficients from
|
| /frameworks/av/media/libstagefright/codecs/amrnb/dec/src/ |
| b_cn_cod.h | 121 ; generation. The algorithm uses polynomial x^31 + x^3 + 1
|
| /frameworks/av/media/libstagefright/codecs/amrwb/src/ |
| isp_az.cpp | 308 Find the polynomial F1(z) or F2(z) from the ISPs.
|
| /prebuilts/gcc/darwin-x86/host/i686-apple-darwin-4.2.1/lib/gcc/i686-apple-darwin10/4.2.1/include/ |
| smmintrin.h | 801 /* Accumulate CRC32 (polynomial 0x11EDC6F41) value. */
|
| /prebuilts/gcc/darwin-x86/host/i686-apple-darwin-4.2.1/lib/gcc/i686-apple-darwin11/4.2.1/include/ |
| smmintrin.h | 801 /* Accumulate CRC32 (polynomial 0x11EDC6F41) value. */
|
| /prebuilts/gcc/darwin-x86/x86/x86_64-linux-android-4.9/lib/gcc/x86_64-linux-android/4.9/include/ |
| smmintrin.h | 825 /* Accumulate CRC32 (polynomial 0x11EDC6F41) value. */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/lib/gcc/x86_64-linux/4.8/include/ |
| smmintrin.h | 799 /* Accumulate CRC32 (polynomial 0x11EDC6F41) value. */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/lib/gcc/x86_64-linux/4.8/include/ |
| smmintrin.h | 799 /* Accumulate CRC32 (polynomial 0x11EDC6F41) value. */
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/include/ |
| smmintrin.h | 799 /* Accumulate CRC32 (polynomial 0x11EDC6F41) value. */
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| ipa-prop.h | 55 functions are called polynomial).
|
| /prebuilts/gcc/linux-x86/x86/x86_64-linux-android-4.9/lib/gcc/x86_64-linux-android/4.9/include/ |
| smmintrin.h | 825 /* Accumulate CRC32 (polynomial 0x11EDC6F41) value. */
|
| /prebuilts/go/darwin-x86/src/crypto/aes/ |
| aes_test.go | 42 // i *= x in GF(2) modulo the polynomial
|
| /prebuilts/go/linux-x86/src/crypto/aes/ |
| aes_test.go | 42 // i *= x in GF(2) modulo the polynomial
|
| /external/ImageMagick/MagickCore/ |
| resize.c | 359 Lagrange piecewise polynomial fit of sinc: N is the 'order' of the lagrange
363 "n" identifies the piece of the piecewise polynomial.
428 for the buck (flops). More specifically: Among the polynomial quotients
430 budget"), the chosen polynomial quotient is the one closest to the
592 % accurate (and fast) polynomial (low Q) and rational (high Q) approximations,
[all...] |
