HomeSort by relevance Sort by last modified time
    Searched full:computation (Results 176 - 200 of 1266) sorted by null

1 2 3 4 5 6 78 91011>>

  /external/srec/tools/thirdparty/OpenFst/fst/lib/
rmepsilon.h 54 // Computation state of the epsilon-removal algorithm.
118 // Shortest distance algorithm computation state.
199 // during the epsilon-closure computation. The state queue discipline
  /external/chromium_org/third_party/mesa/src/docs/
relnotes-8.0.4.html 102 <li>st/mesa: fix mipmap image size computation w.r.t. texture arrays</li>
104 <li>st/mesa: fix max_offset computation for base vertex</li>
  /external/chromium_org/third_party/skia/include/core/
SkRRect.h 22 // add heart rect computation (max rect inside RR)
23 // add 9patch rect computation
  /external/guava/guava/src/com/google/common/hash/
HashFunction.java 133 * Begins a new hash code computation by returning an initialized, stateful {@code
145 * Begins a new hash code computation as {@link #newHasher()}, but provides a hint of the
  /external/libgsm/src/
lpc.c 53 /* Computation of the scaling factor.
261 /* Computation of the LAR[0..7] from the r[0..7]
short_term.c 76 /* Computation of the quantized reflection coefficients
194 * coefficient), it is assumed that the computation begins with index
  /external/mesa3d/docs/
relnotes-8.0.4.html 102 <li>st/mesa: fix mipmap image size computation w.r.t. texture arrays</li>
104 <li>st/mesa: fix max_offset computation for base vertex</li>
  /external/neven/Embedded/common/src/b_TensorEm/
RBFMap2D.h 84 /** matrix needed for computation of rbf coefficients */
88 /** arrays needed for computation of rbf coefficients */
  /external/replicaisland/tools/
ExtractPoints.js 30 /* If set to true, the computation will be rendered graphically to the output
33 /* If true, the computation will be printed in a text layer in the
  /external/skia/include/core/
SkRRect.h 22 // add heart rect computation (max rect inside RR)
23 // add 9patch rect computation
  /frameworks/av/media/libstagefright/codecs/amrwbenc/src/
isp_az.c 190 /* All computation in Q23 */
222 /* All computation in Q23 */
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p2/src/
omxVCM4P2_MCReconBlock_s.s 190 ;// Typical computation for a row goes like this
197 ;// Odd rows undergo following computation after step 3
  /libcore/crypto/src/main/java/org/conscrypt/
ConnectionStateSSLv3.java 48 // (more on SSLv3 MAC computation and payload protection see
219 "Error during computation of security parameters"));
  /libcore/luni/src/main/java/org/apache/harmony/security/provider/crypto/
SHA1Impl.java 47 * Computation is done according to SHA-1 algorithm. <BR>
59 * Computation is done according to SHA-1 algorithm.
  /art/compiler/dex/
mir_analysis.cc 22 // Instruction characteristics used to statically identify computation-intensive methods.
874 * an informed guess before investing in computation. However, we can cheaply detect
952 // Computation intensive?
1056 // o floating point computation
  /dalvik/dx/src/com/android/dx/ssa/
package-info.java 93 * placed in a semi-pruned fashion, which requires computation of {@link
  /external/bison/src/
tables.h 120 computation equals to BASE_MINIMUM, later mapped to BASE_NINF to
  /external/bluetooth/bluedroid/embdrv/sbc/encoder/srce/
sbc_dct_coeffs.c 21 * This file contains the coefficient table used for DCT computation in
  /external/ceres-solver/examples/
snavely_reprojection_error.h 32 // computation for bundle adjustment used by Noah Snavely's Bundler
  /external/ceres-solver/internal/ceres/
corrector.cc 51 // it shouldn't, and the computation of the scaling should proceed
dogleg_strategy.h 40 // Dogleg step computation and trust region sizing strategy based on
dynamic_autodiff_cost_function_test.cc 83 // Test residual computation.
127 // Test jacobian computation.
194 // Test jacobian computation.
244 // Test jacobian computation.
schur_eliminator_impl.h 211 // to this y block in the normal equations. This computation is
252 // for each Chunk. The computation is broken down into a number of
472 // buffer = E'F. This computation is done by iterating over the
503 // computation of the right-hand matrix product, but memory
trust_region_strategy.h 77 // that the Gauss-Newton step computation is of full rank.
  /external/chromium_org/ash/wm/
solo_window_tracker.cc 149 // Various sorts of windows "don't count" for this computation.

Completed in 2944 milliseconds

1 2 3 4 5 6 78 91011>>