| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
| date-format-tofte.js | 177 // thanks to Matt Bannon for some much needed code-fixes here!
|
| /ndk/build/core/ |
| build-local.mk | 109 # something. The result will always be a much longer definition for
|
| definitions-utils.mk | 44 # however this implementation is non-recursive and *much*
|
| /external/ceres-solver/docs/ |
| solving.tex | 299 Thus, the solution of what was an $n\times n$, $n=pc+qs$ linear system is reduced to the inversion of the block diagonal matrix $C$, a few matrix-matrix and matrix-vector multiplies, and the solution of block sparse $pc\times pc$ linear system~\eqref{eq:schur}. For almost all problems, the number of cameras is much smaller than the number of points, $p \ll q$, thus solving~\eqref{eq:schur} is significantly cheaper than solving~\eqref{eq:linear2}. This is the {\em Schur complement trick}~\cite{brown-58}.
330 Another option for bundle adjustment problems is to apply PCG to the reduced camera matrix $S$ instead of $H$. One reason to do this is that $S$ is a much smaller matrix than $H$, but more importantly, it can be shown that $\kappa(S)\leq \kappa(H)$. Ceres implements PCG on $S$ as the \texttt{ITERATIVE\_SCHUR} solver. When the user chooses \texttt{ITERATIVE\_SCHUR} as the linear solver, Ceres automatically switches from the exact step algorithm to an inexact step algorithm.
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...] |
| build.tex | 27 \item{\texttt{CXSparse}~\footnote{\url{http://www.cise.ufl.edu/research/sparse/CXSparse/}}} is used for sparse matrix analysis, ordering and factorization. While it is similar to \texttt{SuiteSparse} in scope, its performance is a bit worse but is a much simpler library to build and does not have any other dependencies. This is an optional dependency.
|
| changes.tex | 199 \item \texttt{system\_test} was taking too long and too much memory (Koichi Akabe)
|
| /external/libvorbis/doc/ |
| 05-comment.tex | 14 The comment field is meant to be used much like someone jotting a
|
| 04-codec.tex | 184 % itemize at the innermost level. However, it would be much better to
587 overlapping a short and long window, much of the returned range does not
|
| 03-codebook.tex | 372 The decoder uses the codebook abstraction much as it does the
|
| /external/bison/doc/ |
| refcard.tex | 231 % we won't be using math mode much, so redefine some of the characters
|
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
| jsilver.sablecc | 160 * convert it into a much simpler Abstract Syntax Tree (AST),
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| recognizers.rb | 179 much of the shared functionality and structure used in the recognition process.
[all...] |
| tree.rb | 204 While much of this terminology is probably familiar to most developers, the
[all...] |
| /external/mksh/src/ |
| check.pl | 832 return "got too much output";
[all...] |
| /external/dropbear/libtommath/ |
| bn.tex | [all...] |
| /external/chromium/chrome/browser/resources/touch_ntp/standalone/ |
| standalone_hack.js | 50 'never been so much fun!',
|
| /external/iproute2/doc/ |
| ip-tunnels.tex | 220 reachable over device \verb|tunl0|. With IPv6 the situation is much simpler:
|
| /external/libvpx/libvpx/vp8/common/x86/ |
| subpixel_mmx.asm | 190 ; recon block should be in cache this shouldn't cost much. Its obviously
|
| /external/v8/test/mjsunit/ |
| unicode-test.js | [all...] |
| /external/dropbear/libtomcrypt/ |
| crypt.tex | [all...] |
| /external/bison/build-aux/ |
| texinfo.tex | 641 % does not have much material. In this case, it's better to add an
678 % \dimen2 is how much space is left on the page (more or less).
755 % That's how much \exdent should take out.
817 % have adopt a much more difficult approach (putting marks into the main
[all...] |
| /external/grub/docs/ |
| texinfo.tex | 203 % have adopt a much more difficult approach (putting marks into the main
673 % does not have much material. In this case, it's better to add an
710 % \dimen2 is how much space is left on the page (more or less).
796 % That's how much \exdent should take out.
[all...] |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
| BaseRecognizer.as | 180 * exception classes. This also makes it much easier for the exception
|
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tools.pas | 314 /// as much as possible. But sometimes, this is impossible.
|
| /external/blktrace/btreplay/doc/ |
| btreplay.tex | 124 much worse timing on a per IO basis.
|
