HomeSort by relevance Sort by last modified time
    Searched full:approximation (Results 301 - 325 of 800) sorted by null

<<11121314151617181920>>

  /libcore/ojluni/src/main/java/java/util/
DualPivotQuicksort.java 279 // Inexpensive approximation of length / 7
477 * This value is inexpensive approximation of the median.
727 // Inexpensive approximation of length / 7
    [all...]
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/makedict/
BinaryDictEncoderUtils.java 600 // unigram frequency) then the unigram frequency itself is the best approximation of the
615 // approximation. (0.5 to get the first step start, and 0.5 to get the middle of the
623 // here. The best approximation would be the unigram freq itself, so we should not
    [all...]
  /bionic/libm/upstream-freebsd/lib/msun/src/
s_expm1.c 40 * maximum error of this polynomial approximation is bounded
  /docs/source.android.com/src/compatibility/cts/
verifier.jd 173 close approximation to the correct value when the overlay and the target
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
DFA.cs 78 * using this DFA (representing the covering regular approximation
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/
DFA.cs 91 * using this DFA (representing the covering regular approximation
  /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/
PolynomialFunctionLagrangeForm.java 183 // initial approximation to the function value at z
  /external/deqp/framework/delibs/debase/
deInt32.c 160 /* First approximation from lookup table. */
  /external/eigen/unsupported/Eigen/src/IterativeSolvers/
MINRES.h 25 * approximation of Ax=b (regardless of b)
  /external/fdlibm/
e_jn.c 27 * for n>x, a continued fraction approximation to
s_expm1.c 37 * maximum error of this polynomial approximation is bounded
  /external/libchrome/base/process/
process_metrics_mac.cc 122 // This is a rough approximation of the algorithm that libtop uses.
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionShapes/
btCompoundShape.cpp 195 //approximation: take the inertia from the aabb for now
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/
btSoftBodyConcaveCollisionAlgorithm.cpp 252 //quick approximation using raycast, todo: hook up to the continuous collision detection (one of the btConvexCast)
  /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/include/freetype/internal/
ftcalc.h 307 * approximation without divisions and square roots relying on Newton's
  /external/libopus/silk/
VAD.c 231 /* Root-mean-square approximation, scale to dBs, and write to output pointer */
  /external/libpng/contrib/tools/
makesRGB.c 14 * approximation to the 8-bit sRGB encoded value. Calculate the error in these
  /external/llvm/examples/ParallelJIT/
ParallelJIT.cpp 17 // call into the JIT at the same time (or the best possible approximation of the
  /external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/tls/
OkHostnameVerifier.java 43 * is an approximation of Android's private InetAddress#isNumeric API.
  /external/opencv/cv/include/
cvtypes.h 90 /* contour approximation method */
  /external/opencv3/doc/py_tutorials/py_feature2d/py_sift_intro/
py_sift_intro.markdown 44 approximation of LoG. Difference of Gaussian is obtained as the difference of Gaussian blurring of
  /external/opencv3/doc/py_tutorials/py_video/py_lucas_kanade/
py_lucas_kanade.markdown 42 Then take taylor series approximation of right-hand side, remove common terms and divide by \f$dt\f$ to
  /external/pcre/dist/doc/
pcrestack.3 145 approximation can be obtained by running this command:
  /external/pdfium/third_party/freetype/include/freetype/internal/
ftcalc.h 307 * approximation without divisions and square roots relying on Newton's
  /external/pdfium/third_party/lcms2-2.6/src/
cmswtpnt.c 267 // This is just an approximation, I am not handling all the non-linear

Completed in 2219 milliseconds

<<11121314151617181920>>