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

1 2 34 5 6 7 8 91011>>

  /external/ceres-solver/internal/ceres/
corrector_test.cc 144 // equations match the robustified gauss newton approximation.
159 // approximation.
183 // and the gauss newton approximation will match. Otherwise, we
227 // approximation.
corrector.cc 69 // concave, the Triggs approximation diverges more and more and
73 // The reason why the Triggs approximation becomes so poor is
  /external/dng_sdk/source/
dng_1d_table.h 71 /// \retval Approximation of function.Evaluate(x)
dng_1d_function.h 57 /// \retval A value x such that Evaluate(x) == y (to very close approximation).
126 /// \retval A value x such that function2.Evaluate(function1.Evaluate(x)) == y (to very close approximation).
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletDynamics/MLCPSolvers/
btDantzigLCP.h 39 and the solution continues. this mechanism allows a friction approximation
  /external/libweave/third_party/chromium/base/third_party/dmg_fp/
g_fmt.cc 20 /* g_fmt(buf,x) stores the closest decimal approximation to x in buf;
  /external/skia/src/pathops/
SkReduceOrder.cpp 52 // look for approximation with single quadratic
53 // save approximation with multiple quadratics for later
183 // look for approximation with single quadratic
184 // save approximation with multiple quadratics for later
  /frameworks/av/media/libeffects/lvm/lib/Common/src/
dB_to_Lin32.c 46 * Remarks : Makes an approximation to the conversion by counting the number
  /packages/apps/Email/res/layout/
account_setup_outgoing_fragment.xml 28 <!-- Note: we use inputType=textUri as the closest approximation to a server name -->
  /prebuilts/go/darwin-x86/src/runtime/
os_linux_arm.go 69 // nanotime() is a poor approximation of CPU ticks that is enough for the profiler.
  /prebuilts/go/linux-x86/src/runtime/
os_linux_arm.go 69 // nanotime() is a poor approximation of CPU ticks that is enough for the profiler.
  /toolchain/binutils/binutils-2.25/libiberty/
clock.c 29 Returns an approximation of the CPU time used by the process as a
  /bionic/libm/upstream-freebsd/lib/msun/src/
k_log.h 31 * 2. Approximation of log(1+f).
37 * of this polynomial approximation is bounded by 2**-58.45. In
s_cbrt.c 82 * to within 2**-23.5 when |r - 1| < 1/10. The rough approximation
97 * approximation barely affects third digit in the final error
  /external/freetype/src/autofit/
afangles.c 34 * approximation. We are going to use the result of `af_angle_atan' to
38 * The approximation
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/
btConvex2dConvex2dAlgorithm.cpp 185 btSphereShape sphere1(col1->getCcdSweptSphereRadius()); //todo: allow non-zero sphere sizes, for better approximation
218 btSphereShape sphere0(col0->getCcdSweptSphereRadius()); //todo: allow non-zero sphere sizes, for better approximation
  /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/autofit/
afangles.c 34 * approximation. We are going to use the result of `af_angle_atan' to
38 * The approximation
  /external/llvm/test/MC/Hexagon/instructions/
xtype_fp.s 108 # Floating point reciprocal square root approximation
140 # Floating point reciprocal approximation
  /frameworks/av/media/libstagefright/codecs/amrwbenc/src/
oper_32b.c 188 * First approximation: approx = 1 / denom_hi *
200 /* First approximation: 1 / L_denom = 1/denom_hi */
  /ndk/sources/android/support/src/msun/
k_log.h 31 * 2. Approximation of log(1+f).
37 * of this polynomial approximation is bounded by 2**-58.45. In
  /packages/apps/UnifiedEmail/src/com/android/mail/providers/
ConversationInfo.java 41 // message count is a decent approximation of participant count because for all incoming
48 // message count is a decent approximation of participant count because for all incoming
  /prebuilts/go/darwin-x86/src/math/
log.go 33 // 2. Approximation of log(1+f).
39 // of this polynomial approximation is bounded by 2**-58.45. In
  /prebuilts/go/linux-x86/src/math/
log.go 33 // 2. Approximation of log(1+f).
39 // of this polynomial approximation is bounded by 2**-58.45. In
  /system/bt/embdrv/sbc/decoder/srce/
dequant.c 38 This function is a fixed-point approximation of a modification of the following
89 result is therefore a scaled approximation to dequant. It remains only to
  /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/
BrentSolver.java 291 * @param x0 old approximation for the root
292 * @param y0 function value at the approximation for the root
293 * @param x1 last calculated approximation for the root
294 * @param y1 function value at the last calculated approximation
315 // use the bracket point if is better than last approximation

Completed in 1653 milliseconds

1 2 34 5 6 7 8 91011>>