HomeSort by relevance Sort by last modified time
    Searched refs:approximately (Results 1 - 10 of 10) sorted by null

  /external/libvorbis/doc/
07-floor1.tex 180 which happens to be approximately -140dB).
01-introduction.tex 470 spec. A 280dB range is approximately 48 bits with sign; thus the
04-codec.tex 558 spec. A 280dB range is approximately 48 bits with sign; thus the
  /external/oprofile/events/i386/nehalem/
events 72 event:0xA7 counters:0,1,2,3 um:one minimum:6000 name:BACLEAR_FORCE_IQ : Counts number of times a BACLEAR was forced by the Instruction Queue. The IQ is also responsible for providing conditional branch prediciton direction based on a static scheme and dynamic data provided by the L2 Branch Prediction Unit. If the conditional branch target is not found in the Target Array and the IQ predicts that the branch is taken, then the IQ will force the Branch Address Calculator to issue a BACLEAR. Each BACLEAR asserted by the BAC generates approximately an 8 cycle bubble in the instruction fetch pipeline.
  /external/ceres-solver/docs/
solving.tex 79 The factorization methods are based on computing an exact solution of~\eqref{eq:lsqr} using a Cholesky or a QR factorization and lead to an exact step Levenberg-Marquardt algorithm. But it is not clear if an exact solution of~\eqref{eq:lsqr} is necessary at each step of the LM algorithm to solve~\eqref{eq:nonlinsq}. In fact, we have already seen evidence that this may not be the case, as~\eqref{eq:lsqr} is itself a regularized version of~\eqref{eq:linearapprox}. Indeed, it is possible to construct non-linear optimization algorithms in which the linearized problem is solved approximately. These algorithms are known as inexact Newton or truncated Newton methods~\cite{nocedal2000numerical}.
81 An inexact Newton method requires two ingredients. First, a cheap method for approximately solving systems of linear equations. Typically an iterative linear solver like the Conjugate Gradients method is used for this purpose~\cite{nocedal2000numerical}. Second, a termination rule for the iterative solver. A typical termination rule is of the form
    [all...]
  /external/openssl/crypto/bn/asm/
pa-risc2.s 10 ; This code is approximately 2x faster than the C version
    [all...]
pa-risc2W.s 4 ; This code is approximately 2x faster than the C version
    [all...]
  /external/v8/test/mjsunit/
unicode-test.js     [all...]
  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.pas     [all...]
  /external/dropbear/libtomcrypt/
crypt.tex     [all...]

Completed in 1012 milliseconds