HomeSort by relevance Sort by last modified time
    Searched refs:usually (Results 1 - 25 of 44) sorted by null

1 2

  /external/antlr/antlr-3.4/runtime/Perl5/lib/ANTLR/
Runtime.pm 93 The initial template usually just has:
  /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_tools_windows/tools/
symshift.pl 101 usually only -phones ans -POS are used.
  /external/ceres-solver/docs/
nnlsq.tex 13 Such optimization problems arise in almost every area of science and engineering. Whenever there is data to be analyzed, curves to be fitted, there is usually a linear or a non-linear least squares problem lurking in there somewhere.
bundleadjustment.tex 6 Given a set of measured image feature locations and correspondences, the goal of bundle adjustment is to find 3D point positions and camera parameters that minimize the reprojection error. This optimization problem is usually formulated as a non-linear least squares problem, where the error is the squared $L_2$ norm of the difference between the observed feature location and the projection of the corresponding 3D point on the image plane of the camera. Ceres has extensive support for solving bundle adjustment problems.
solving.tex 238 Large non-linear least square problems are usually sparse. In such cases, using a dense QR factorization is inefficient. Let $H = R^\top R$ be the Cholesky factorization of the normal equations, where $R$ is an upper triangular matrix, then the solution to ~\eqref{eq:normal} is given by
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.
488 invalid, usually because of conditioning issues. Instead of crashing
    [all...]
  /ndk/sources/host-tools/make-3.81/
configure.bat 41 rem If it can run Make, it will usually return 2,
  /external/webkit/LayoutTests/fast/url/script-tests/
file-http-base.js 11 // URL itself so it can call the file canonicalizer. This is usually
file.js 11 // URL itself so it can call the file canonicalizer. This is usually
  /external/libvorbis/doc/
05-comment.tex 11 separate logical bitstream (usually an XML stream type) that provides
114 The artist generally considered responsible for the work. In popular music this is usually the performing band or singer. For classical music it would be the composer. For an audio book it would be the author of the original text.
  /external/chromium/chrome/common/extensions/docs/examples/extensions/benchmark/jst/
jsevalcontext.js 117 * expressions are evaluated. Notice that this is usually an Object,
240 * the given value. This value usually is the position of the data
util.js 149 * Clears the array by setting the length property to 0. This usually
  /external/chromium/chrome/common/extensions/docs/examples/extensions/irc/servlet/jstemplate/
jsevalcontext.js 117 * expressions are evaluated. Notice that this is usually an Object,
240 * the given value. This value usually is the position of the data
util.js 149 * Clears the array by setting the length property to 0. This usually
  /build/core/
cleanbuild.mk 58 # If the clean_steps.mk file is missing (usually after a clean build)
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
token.rb 41 text. Tokens also usually carry information about their location in the input,
46 categorization that groups things on a larger scale. Parsers will usually ignore
streams.rb 159 manipulate stream objects don't usually bother checking that the object is a
220 # indicates an identifying name for the stream -- usually the file path of the input
280 usually a lexer. They provide the operations required by higher-level
380 # the name associated with the stream -- usually a file name
761 # usually a lexer, but can be any object that implements +next_token+ and includes
    [all...]
  /external/v8/test/mjsunit/
const-redecl.js 52 // NOTE: TestGlobal usually only tests the given string in the context
  /dalvik/vm/
Dvm.mk 343 # The following symbols are usually defined in the asm file, but
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Ruby/
Ruby.stg     [all...]
  /external/icu4c/
icudefs.mk 45 # The ICU data external name is usually icudata; the entry point name is
  /external/v8/benchmarks/
deltablue.js 631 * constraints, usually a set of input constraints. This method
665 * given constraints, usually a set of input constraints.
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/
v8-deltablue.js 625 * constraints, usually a set of input constraints. This method
659 * given constraints, usually a set of input constraints.
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/
v8-deltablue.js 625 * constraints, usually a set of input constraints. This method
659 * given constraints, usually a set of input constraints.
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/
v8-deltablue.js 625 * constraints, usually a set of input constraints. This method
659 * given constraints, usually a set of input constraints.
  /libcore/xml/src/main/java/org/kxml2/io/
KXmlParser.java     [all...]

Completed in 888 milliseconds

1 2