HomeSort by relevance Sort by last modified time
    Searched full:polynomial (Results 126 - 150 of 228) sorted by null

1 2 3 4 56 7 8 910

  /external/openssl/crypto/ec/
ec_oct.c 60 * Binary polynomial ECC support in OpenSSL originally developed by
ec2_smpl.c 699 /* Wrapper to simple binary polynomial field multiplication implementation. */
706 /* Wrapper to simple binary polynomial field squaring implementation. */
713 /* Wrapper to simple binary polynomial field division implementation. */
ec.h 71 * The elliptic curve binary polynomial software is originally written by
307 * \param p BIGNUM with the polynomial defining the underlying field
317 * \param p BIGNUM for the polynomial defining the underlying field
368 * \param p BIGNUM with the polynomial defining the underlying field
    [all...]
ec_lcl.h 67 * The elliptic curve binary polynomial software is originally written by
210 * irreducible polynomial defining the field.
  /external/webrtc/src/modules/audio_coding/codecs/isac/main/source/
filter_functions.c 165 /* Get LPC polynomial */
  /frameworks/base/libs/androidfw/
VelocityTracker.cpp 393 * Solves a linear least squares problem to obtain a N degree polynomial that fits
401 * The output is a vector B with indices 0..n that describes a polynomial
410 * the polynomial. It is a good idea to choose weights that diminish the importance
593 // Calculate a least squares polynomial fit.
    [all...]
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/
HermiteInterpolator.java 145 * with the slope of the tangent m1 at p1 and m2 at p2, the polynomial of cubic Hermite curve
  /external/aac/libFDK/src/
fixpoint_math.cpp 131 description: Delivers the Logarithm Dualis ld(op)/LD_DATA_SCALING with polynomial approximation.
622 /* Evaluate taylor polynomial which approximates 2^x */
637 /* "+ 1" compensates fMultAddDiv2() of the polynomial evaluation above. */
  /external/openssl/crypto/modes/asm/
ghash-armv4.pl 35 # Add NEON implementation featuring polynomial multiplication, i.e. no
330 vmov.i32 $mod,#0xe1 @ our irreducible polynomial
353 vmov.i32 $mod,#0xe1 @ our irreducible polynomial
  /frameworks/av/media/libstagefright/codecs/amrnb/common/src/
lsp_az.cpp 137 f = pointer to the polynomial of type Word32 to be generated
143 buffer pointed to by f contains the polynomial generated
160 This function finds the polynomial F1(z) or F2(z) from the LSPs. If the LSP
309 f = pointer to the polynomial of type Word32 to be generated
315 buffer pointed to by f contains the polynomial generated
  /external/eigen/bench/
eig33.cpp 75 // Compute the eigenvalues by solving for the roots of the polynomial.
  /external/openssl/crypto/bn/asm/
s390x-gf2m.pl 12 # The module implements bn_GF2m_mul_2x2 polynomial multiplication used
  /external/openssl/crypto/bn/
bn_gf2m.c 129 * result is a polynomial r with degree < 2 * BN_BITS - 1
207 * result is a polynomial r with degree < 4 * BN_BITS2 - 1
1055 /* Convert the bit-string representation of a polynomial
1094 /* Convert the coefficient array representation of a polynomial to a
  /external/openssl/include/openssl/
ec.h 71 * The elliptic curve binary polynomial software is originally written by
307 * \param p BIGNUM with the polynomial defining the underlying field
317 * \param p BIGNUM for the polynomial defining the underlying field
368 * \param p BIGNUM with the polynomial defining the underlying field
    [all...]
  /external/skia/include/core/
SkGeometry.h 92 /** Convert from parametric from (pts) to polynomial coefficients
  /external/skia/legacy/include/core/
SkGeometry.h 92 /** Convert from parametric from (pts) to polynomial coefficients
  /frameworks/av/media/libstagefright/codecs/amrwbenc/src/
isp_az.c 169 * Find the polynomial F1(z) or F2(z) from the ISPs. *
  /external/qemu/hw/
ne2000.c 177 #define POLYNOMIAL 0x04c11db6
195 crc = ((crc ^ POLYNOMIAL) | carry);
  /external/speex/libspeex/
lsp.c 55 A(z) is a polynomial of order lpcrdr with {ak} as the coefficients.
313 /* Search for a zero in P'(z) polynomial first and then alternate to Q'(z).
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
determinize.h 523 // - Determinizable: exponential (polynomial in the size of the output)
701 // - Determinizable: exponential (polynomial in the size of the output)
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1/
hypergeometric.tcc 68 * series is a polynomial with a finite number of terms. If b is an integer
751 // For integer a and b the hypergeometric function is a finite polynomial.
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/
hypergeometric.tcc 68 * then the series is a polynomial with a finite number of
755 // finite polynomial.
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/
hypergeometric.tcc 68 * then the series is a polynomial with a finite number of
755 // finite polynomial.
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/tr1/
hypergeometric.tcc 68 * series is a polynomial with a finite number of terms. If b is an integer
751 // For integer a and b the hypergeometric function is a finite polynomial.
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/tr1/
hypergeometric.tcc 68 * series is a polynomial with a finite number of terms. If b is an integer
751 // For integer a and b the hypergeometric function is a finite polynomial.

Completed in 2771 milliseconds

1 2 3 4 56 7 8 910