Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:approximation (Results 351 - 375 of 800) sorted by null

<<11121314151617181920>>

/external/v8/src/
string-search.h	26 // of the string, but it is a safe approximation. 33 // a potentially less efficient searching, but is a safe approximation.
/external/webrtc/webrtc/modules/audio_processing/aec/
aec_core_neon.c	282 // five polynomial approximation. The coefficients have been 345 // polynomial approximation. The coefficients have been estimated
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/inference/
TTest.java	465 * {@link #t(double[], double[])} and the Welch-Satterthwaite approximation 544 * Welch-Satterthwaite approximation.</a></p>     [all...]
TTestImpl.java	548 * {@link #t(double[], double[])} and the Welch-Satterthwaite approximation 641 * Welch-Satterthwaite approximation.</a></p>     [all...]
/external/libopus/celt/
bands.c	66 /* This is a cos() approximation designed to be bit-exact on any platform. Bit exactness 67 with this approximation is important because it has an impact on the bit allocation */ 946 /* Rough approximation for pre-echo masking */     [all...]
vq.c	211 to be allocated. 64 is an approximation of infinity here. */
/external/opencv/cv/src/
cvcontours.cpp	354 (with optional convertion from chains to contours using some approximation from 527 >0 - simple approximation     [all...]
/external/opencv3/modules/imgproc/src/
contours.cpp	331 (with optional conversion from chains to contours using some approximation from 497 >0 - simple approximation     [all...]
/external/v8/src/third_party/fdlibm/
fdlibm.js	415 // 2. Approximation of log1p(f). 421 // of this polynomial approximation is bounded by 2**-58.45. In 589 // maximum error of this polynomial approximation is bounded     [all...]
/bionic/libm/upstream-freebsd/lib/msun/src/
e_jn.c	30 * for n>x, a continued fraction approximation to
/bionic/libm/x86/
e_exp.S	45 // P(y) is a minimax polynomial approximation of exp(x)-1
/cts/hostsidetests/sustainedperf/dhrystone/
dhry.h	137 * As an approximation to what an average C programmer
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/
DirectSearchOptimizer.java	41 * need derivatives and don't either try to compute approximation of
/external/autotest/client/site_tests/network_EthernetStressPlug/
network_EthernetStressPlug.py	273 # (translated to an approximation of the number of seconds)
/external/autotest/server/cros/network/
attenuator_controller.py	226 from a nearby channel as an approximation.
/external/ceres-solver/internal/ceres/
graph_algorithms.h	83 // approximation algorithms available. The implementation here uses a
/external/clang/include/clang/AST/
StmtCXX.h	234 /// approximation of the VC++ behavior.
/external/clang/lib/StaticAnalyzer/Checkers/
PaddingChecker.cpp	187 /// 1. Find a close approximation to where we can place our first field.
/external/clang/lib/StaticAnalyzer/Core/
SymbolManager.cpp	433 // FIXME: This is a gross over-approximation. What we really need is a way to
/external/eigen/unsupported/Eigen/src/MatrixFunctions/
MatrixExponential.h	112 * squarings are chosen such that the approximation error is no
/external/icu/icu4c/source/common/
ubidiimp.h	293 /* are we performing an approximation of the "inverse BiDi" algorithm? */
/external/icu/icu4c/source/i18n/
hebrwcal.h	37 * on the day of (an arithmetic approximation of) each new moon. Since the
indiancal.h	167 * or an approximation of the religious, astronomical calendar.
islamcal.h	75 * is called, an approximation of the true lunar calendar will be used.
/external/libunwind_llvm/src/
Unwind-sjlj.c	462 // Instead, the SP in the jmpbuf is the closest approximation.

Completed in 2319 milliseconds

<<11121314151617181920>>