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

1 23 4 5 6 7 8 91011>>

  /frameworks/av/media/libeffects/testlibs/
AudioCoefInterpolator.h 28 // The purpose is efficient approximation of a N-dimensional vector to
29 // M-dimensional function. The approximation is based on a table of output
  /packages/apps/ExactCalculator/docs/
implementation-overview.html 20 exact answers in "easy" cases. It is used primarily to determine when an approximation provided
37 (1) Initial evaluation of the expression and producing an initial decimal approximation, and (2)
  /external/opencv3/doc/tutorials/imgproc/imgtrans/sobel_derivatives/
sobel_derivatives.markdown 19 important convolutions is the computation of derivatives in an image (or an approximation to
47 -# The Sobel Operator is a discrete differentiation operator. It computes an approximation of the
74 -# At each point of the image we calculate an approximation of the *gradient* in that point by
85 inaccuracies (after all, Sobel is only an approximation of the derivative). OpenCV addresses
  /external/webrtc/webrtc/modules/audio_processing/transient/
daubechies_8_wavelet_coeffs.h 11 // This header file defines the coefficients of the FIR based approximation of
  /frameworks/base/core/java/android/widget/
AlphabetIndexer.java 175 // an approximation and positive value when it is the accurate
214 // TODO: Commenting out approximation code because it doesn't work for certain
216 // Enter approximation in hash if a better solution doesn't exist
221 // Negative pos indicates that it is an approximation
  /system/media/audio_utils/
limiter.c 44 // atan approximation
  /external/crcalc/
impl.html 35 integer approximation to <I>x</i>, with an error of strictly less than
43 caches the best previous approximation computed so far.
76 more expensive than a direct implementation, since each time an approximation
  /external/libopus/silk/fixed/
apply_sine_window_FIX.c 71 /* Factor used for cosine approximation */
79 /* approximation of sin(f) */
84 /* approximation of cos(f) */
  /external/libvorbis/doc/vorbisfile/
crosslap.html 31 signal is at best a close approximation of the original. The
32 approximation may be very good (ie, indistingushable to the human
33 ear), but it is an approximation nonetheless. Even if a sample or set
  /external/opencv3/doc/py_tutorials/py_imgproc/py_contours/py_contours_begin/
py_contours_begin.markdown 36 is contour retrieval mode, third is contour approximation method. And it outputs the contours and
68 Contour Approximation Method
75 this contour approximation method.
  /external/skia/src/pathops/
SkPathOpsTypes.cpp 178 // cube root approximation using bit hack for 64-bit float
189 // iterative cube root approximation using Halley's method (double)
196 // cube root approximation using 3 iterations of Halley's method (double)
  /bionic/libm/upstream-freebsd/lib/msun/src/
s_erf.c 58 * That is, we use rational approximation to approximate
93 * We use rational approximation to approximate
131 * Coefficients for approximation to erf on [0,0.84375]
144 * Coefficients for approximation to erf in [0.84375,1.25]
160 * Coefficients for approximation to erfc in [1.25,1/0.35]
179 * Coefficients for approximation to erfc in [1/.35,28]
s_log1p.c 30 * 2. Approximation of log1p(f).
36 * of this polynomial approximation is bounded by 2**-58.45. In
142 * The approximation to sqrt(2) used in thresholds is not
  /external/ceres-solver/include/ceres/
types.h 191 // BFGS, and it's limited memory approximation L-BFGS, are quasi-Newton
198 // equation. The requirement that the Hessian approximation be positive
202 // approximation at the next iteration must be the 'closest' to the current
203 // approximation (the nature of how this proximity is measured is actually
209 // maintains a full, dense approximation to the (inverse) Hessian, L-BFGS
213 // full dense inverse Hessian approximation. This is particularly important
  /external/fdlibm/
s_erf.c 56 * That is, we use rational approximation to approximate
91 * We use rational approximation to approximate
123 * Coefficients for approximation to erf on [0,0.84375]
138 * Coefficients for approximation to erf in [0.84375,1.25]
154 * Coefficients for approximation to erfc in [1.25,1/0.35]
173 * Coefficients for approximation to erfc in [1/.35,28]
  /prebuilts/go/darwin-x86/src/math/
erf.go 68 // That is, we use rational approximation to approximate
103 // We use rational approximation to approximate
121 // Coefficients for approximation to erf in [0, 0.84375]
134 // Coefficients for approximation to erf in [0.84375, 1.25]
148 // Coefficients for approximation to erfc in [1.25, 1/0.35]
165 // Coefficients for approximation to erfc in [1/.35, 28]
  /prebuilts/go/linux-x86/src/math/
erf.go 68 // That is, we use rational approximation to approximate
103 // We use rational approximation to approximate
121 // Coefficients for approximation to erf in [0, 0.84375]
134 // Coefficients for approximation to erf in [0.84375, 1.25]
148 // Coefficients for approximation to erfc in [1.25, 1/0.35]
165 // Coefficients for approximation to erfc in [1/.35, 28]
  /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/
SecantSolver.java 165 // Index 0 is the old approximation for the root.
166 // Index 1 is the last calculated approximation for the root.
210 // New approximation falls outside bracket.
  /external/apache-commons-math/src/main/java/org/apache/commons/math/special/
Beta.java 67 * series is less than epsilon the approximation ceases
111 * series is less than epsilon the approximation ceases
183 * series is less than epsilon the approximation ceases
  /external/ceres-solver/internal/ceres/
low_rank_inverse_hessian.cc 60 // to update the Hessian approximation if:
139 // Rescale the initial inverse Hessian approximation (H_0) to be iteratively
173 << "approximation.";
  /external/compiler-rt/lib/builtins/
divsf3.c 81 // polynomial approximation: reciprocal = 3/4 + 1/sqrt(2) - b/2. This
90 // This doubles the number of correct binary digits in the approximation
105 // be specific). This also causes 1/1 to give a sensible approximation
  /external/libgdx/gdx/src/com/badlogic/gdx/math/
Ellipse.java 188 * @return The Ramanujan approximation to the circumference of an ellipse if one dimension is at least three times longer than
189 * the other, else the simpler approximation */
197 // We can use the simpler approximation, then
  /external/neven/Embedded/common/src/b_BasicEm/
Math.h 67 /** Sqrt approximation */
70 /** sqrt(1/x) approximation
75 /** 1/x approximation
  /external/skia/src/gpu/effects/
GrBezierEffect.h 23 * first order approximation from the taylor series.
26 * Test were also run using a second order distance approximation.
216 * first order approximation from the taylor series.
  /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/
Preconditioner.java 45 * @return approximation of H<sup>-1</sup>r where H is the objective function hessian

Completed in 1087 milliseconds

1 23 4 5 6 7 8 91011>>