OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:polynomials
(Results
26 - 50
of
155
) sorted by null
1
2
3
4
5
6
7
/external/webrtc/webrtc/modules/audio_coding/codecs/ilbc/
get_lsp_poly.h
25
* Construct the
polynomials
F1(z) and F2(z) from the LSP
get_lsp_poly.c
22
* Construct the
polynomials
F1(z) and F2(z) from the LSP
poly_to_lsp.c
45
Calculate the two
polynomials
f1(z) and f2(z)
/prebuilts/go/darwin-x86/src/hash/crc64/
crc64.go
15
// Predefined
polynomials
.
/prebuilts/go/linux-x86/src/hash/crc64/
crc64.go
15
// Predefined
polynomials
.
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/
DividedDifferenceInterpolator.java
22
import org.apache.commons.math.analysis.
polynomials
.PolynomialFunctionLagrangeForm;
23
import org.apache.commons.math.analysis.
polynomials
.PolynomialFunctionNewtonForm;
SmoothingPolynomialBicubicSplineInterpolator.java
25
import org.apache.commons.math.analysis.
polynomials
.PolynomialFunction;
45
* Default constructor. The degree of the fitting
polynomials
is set to 3.
BicubicSplineInterpolator.java
22
import org.apache.commons.math.analysis.
polynomials
.PolynomialSplineFunction;
/external/ceres-solver/internal/ceres/
polynomial.h
42
// All
polynomials
are assumed to be the form
78
// x_min and x_max. Since
polynomials
are differentiable functions,
/prebuilts/go/darwin-x86/src/hash/crc32/
crc32.go
9
//
Polynomials
are represented in LSB-first form also known as reversed representation.
23
// Predefined
polynomials
.
/prebuilts/go/linux-x86/src/hash/crc32/
crc32.go
9
//
Polynomials
are represented in LSB-first form also known as reversed representation.
23
// Predefined
polynomials
.
/external/libvorbis/lib/
lsp.c
418
/* Compute the lengths of the x
polynomials
. */
419
/* Compute the first half of K & R F1 & F2
polynomials
. */
420
/* Compute half of the symmetric and antisymmetric
polynomials
. */
435
/* Convert into
polynomials
in cos(alpha) */
439
/* Find the roots of the 2 even
polynomials
.*/
/external/speex/libspeex/
lsp.c
71
polynomials
.
133
This function evaluates a series of Chebyshev
polynomials
244
m = lpcrdr/2; /* order of P'(z) & Q'(z)
polynomials
*/
246
/* Allocate memory space for
polynomials
*/
314
Keep alternating between the two
polynomials
as each zero is found */
420
Reconstruct P(z) and Q(z) by cascading second order
polynomials
556
polynomials
in form 1 - 2xz(-1) +z(-2), where x is the
/external/eigen/unsupported/doc/examples/
PolynomialSolver1.cpp
1
#include <unsupported/Eigen/
Polynomials
>
/external/libopus/silk/
NLSF2A.c
115
/* generate even and odd
polynomials
using convolution */
119
/* convert even and odd
polynomials
to opus_int32 Q12 filter coefs */
/external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod/python2/crcmod/
test.py
45
#
polynomials
.
64
# I was able to locate a couple of 64-bit
polynomials
on the web. To make it
93
'''Class implementing
polynomials
over the field of integers mod 2'''
108
# To allow sorting of
polynomials
, use their long integer form for
117
return self # These
polynomials
are their own inverse under addition
/external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod/python3/crcmod/
test.py
40
#
polynomials
.
59
# I was able to locate a couple of 64-bit
polynomials
on the web. To make it
88
'''Class implementing
polynomials
over the field of integers mod 2'''
103
# To allow sorting of
polynomials
, use their long integer form for
112
return self # These
polynomials
are their own inverse under addition
/external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod_osx/crcmod/
test.py
45
#
polynomials
.
64
# I was able to locate a couple of 64-bit
polynomials
on the web. To make it
93
'''Class implementing
polynomials
over the field of integers mod 2'''
108
# To allow sorting of
polynomials
, use their long integer form for
117
return self # These
polynomials
are their own inverse under addition
/external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod/docs/source/
crcmod.rst
34
are the coefficients of the polynomial. The only
polynomials
allowed are
119
are the coefficients of the polynomial. The only
polynomials
allowed are
/bionic/libc/include/net/
if_ether.h
97
* Ethernet CRC32
polynomials
(big- and little-endian verions).
/development/ndk/platforms/android-21/include/net/
if_ether.h
97
* Ethernet CRC32
polynomials
(big- and little-endian verions).
/development/ndk/platforms/android-3/include/net/
if_ether.h
97
* Ethernet CRC32
polynomials
(big- and little-endian verions).
/external/eigen/unsupported/test/
polynomialsolver.cpp
11
#include <unsupported/Eigen/
Polynomials
>
/prebuilts/ndk/current/platforms/android-12/arch-arm/usr/include/net/
if_ether.h
97
* Ethernet CRC32
polynomials
(big- and little-endian verions).
/prebuilts/ndk/current/platforms/android-12/arch-mips/usr/include/net/
if_ether.h
97
* Ethernet CRC32
polynomials
(big- and little-endian verions).
Completed in 1865 milliseconds
1
2
3
4
5
6
7