HomeSort by relevance Sort by last modified time
    Searched refs:equivalent (Results 76 - 100 of 121) sorted by null

1 2 34 5

  /external/clang/include/clang/AST/
Type.h     [all...]
  /external/libvorbis/doc/
01-introduction.tex 313 produces entirely equivalent output and is naturally perfectly legal.
314 The decoder must be \emph{entirely mathematically equivalent} to the
08-residue.tex 145 vector to begin with, residue type 1 and type 2 are equivalent.
  /ndk/build/core/
init.mk 327 # Define HOST_ECHO_N to perform the equivalent of 'echo -n' on all platforms.
definitions.mk 165 # NOTE: With GNU Make $1 and $(1) are equivalent, which means
166 # that $10 is equivalent to $(1)0, and *not* $(10).
    [all...]
  /dalvik/vm/mterp/mips/
footer.S 454 * The equivalent of "goto bail", this calls through the "bail handler".
689 # equivalent to dvmPopJniLocals
    [all...]
  /external/dropbear/libtommath/
bn.tex     [all...]
  /dalvik/vm/mterp/armv5te/
footer.S 136 * and the native sp so that we can later do the equivalent of a
442 * The equivalent of "goto bail", this calls through the "bail handler".
663 @ equivalent to dvmPopJniLocals
    [all...]
  /external/ceres-solver/docs/
solving.tex 223 Let $H(x)= J(x)^\top J(x)$ and $g(x) = -J(x)^\top f(x)$. For notational convenience let us also drop the dependence on $x$. Then it is easy to see that solving~\eqref{eq:simple2} is equivalent to solving the {\em normal equations}
349 The computational cost of using a preconditioner $M$ is the cost of computing $M$ and evaluating the product $M^{-1}y$ for arbitrary vectors $y$. Thus, there are two competing factors to consider: How much of $H$'s structure is captured by $M$ so that the condition number $\kappa(HM^{-1})$ is low, and the computational cost of constructing and using $M$. The ideal preconditioner would be one for which $\kappa(M^{-1}A) =1$. $M=A$ achieves this, but it is not a practical choice, as applying this preconditioner would require solving a linear system equivalent to the unpreconditioned problem. It is usually the case that the more information $M$ has about $H$, the more expensive it is use. For example, Incomplete Cholesky factorization based preconditioners have much better convergence behavior than the Jacobi preconditioner, but are also much more expensive.
    [all...]
  /external/clang/lib/Driver/
Driver.cpp     [all...]
  /external/guava/guava/src/com/google/common/collect/
Maps.java 366 if (valueEquivalence.equivalent(leftValue, rightValue)) {
    [all...]
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
Maps.java 363 if (valueEquivalence.equivalent(leftValue, rightValue)) {
    [all...]
  /external/blktrace/btreplay/doc/
btreplay.tex 508 be equivalent of not having stall.
  /dalvik/docs/
prettify.js 435 * significant for tokenization (<br>) into their textual equivalent.
    [all...]
  /external/grub/docs/
texinfo.tex 448 % is roughly equivalent to
629 % equivalent to this in @example-like environments. Otherwise, a space
    [all...]
  /external/bison/build-aux/
texinfo.tex 480 % is roughly equivalent to
582 % equivalent to this in @example-like environments. Otherwise, a space
    [all...]
  /external/bison/
maint.mk 537 # 2) notice that "c(har)?|[mz]" is equivalent to the shorter and more readable
    [all...]
  /libcore/benchmarks/libs/
caliper.jar 
  /external/llvm/bindings/ocaml/llvm/
llvm.mli 790 equivalent to [const_ptrtoint (const_gep (const_null (pointer_type {i8,ty}))
796 equivalent to [const_ptrtoint (const_gep (const_null (pointer_type ty))
    [all...]
  /external/regex-re2/lib/codereview/
codereview.py 38 "hg diff @123456" is equivalent to"hg diff x.go y.go".
    [all...]
  /ndk/sources/host-tools/sed-4.2.1/build-aux/
texinfo.tex 501 % is roughly equivalent to
682 % equivalent to this in @example-like environments. Otherwise, a space
    [all...]
  /external/dropbear/libtomcrypt/
crypt.tex     [all...]
  /external/v8/test/mjsunit/
unicode-test.js     [all...]
  /prebuilts/sdk/tools/lib/
signapk.jar 
lombok-ast-0.2.jar 

Completed in 1617 milliseconds

1 2 34 5