| /external/clang/lib/Rewrite/Core/ |
| TokenRewriter.cpp | 70 TokenRewriter::AddToken(const Token &T, TokenRefTy Where) {
71 Where = TokenList.insert(Where, T);
74 Where)).second;
77 return Where;
|
| /external/clang/include/clang/Rewrite/Core/ |
| TokenRewriter.h | 72 TokenRefTy AddToken(const Token &T, TokenRefTy Where);
|
| /external/valgrind/main/exp-bbv/tests/amd64-linux/ |
| fldcw_check.S | 15 # Where xx is the "mod" which will be 00, 01, or 10 indicating offset
|
| /external/valgrind/main/exp-bbv/tests/x86/ |
| fldcw_check.S | 15 # Where xx is the "mod" which will be 00, 01, or 10 indicating offset
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineBasicBlock.h | 528 /// into this MBB right before 'Where'.
531 void splice(iterator Where, MachineBasicBlock *Other, iterator From) {
533 if (Where != From)
534 splice(Where, Other, From, llvm::next(From));
538 /// and insert them into this MBB right before 'Where'.
540 /// The instruction at 'Where' must not be included in the range of
542 void splice(iterator Where, MachineBasicBlock *Other,
544 Insts.splice(Where.getInstrIterator(), Other->Insts,
|
| /external/ceres-solver/docs/ |
| reference-overview.tex | 9 Where $f_i(\cdot)$ is a cost function that depends on the parameter blocks $\left[x_{i_1}, \hdots , x_{i_k}\right]$ and $\rho_i$ is a loss function. In most optimization problems small groups of scalars occur together. For example the three components of a translation vector and the four components of the quaternion that define the pose of a camera. We refer to such a group of small scalars as a Parameter Block. Of course a parameter block can just have a single parameter.
|
| solving.tex | 13 Here, the Jacobian $J(x)$ of $F(x)$ is an $m\times n$ matrix, where $J_{ij}(x) = \partial_j f_i(x)$ and the gradient vector $g(x) = \nabla \frac{1}{2}\|F(x)\|^2 = J(x)^\top F(x)$. Since the efficient global optimization of~\eqref{eq:nonlinsq} for general $F(x)$ is an intractable problem, we will have to settle for finding a local minimum.
23 of the step $\Delta x$. And this is where the idea of a trust-region
65 Where, $\lambda$ is a Lagrange multiplier that is inverse related to $\mu$. In Ceres, we solve for
158 This idea can be generalized to cases where the residual is not
231 For small problems (a couple of hundred parameters and a few thousand residuals) with relatively dense Jacobians, \texttt{DENSE\_QR} is the method of choice~\cite{bjorck1996numerical}. Let $J = QR$ be the QR-decomposition of $J$, where $Q$ is an orthonormal matrix and $R$ is an upper triangular matrix~\cite{trefethen1997numerical}. Then it can be shown that the solution to~\eqref{eq:normal} is given by
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
261 Suppose that the SfM problem consists of $p$ cameras and $q$ points and the variable vector $x$ has the block structure $x = [y_{1},\hdots,y_{p},z_{1},\hdots,z_{q}]$. Where, $y$ and $z$ correspond to camera and point parameters, respectively. Further, let the camera blocks be of size $c$ and the point blocks be of size $s$ (for most problems $c$ = $6$--$9$ and $s = 3$). Ceres does not impose any constancy requirement on these block sizes, but choosing them to be constant simplifies the exposition.
271 where, $B \in \reals^{pc\times pc}$ is a block sparse matrix with $p$ blocks of size $c\times c$ and $C \in \reals^{qs\times qs}$ is a block diagonal matrix with $q$ blocks of size $s\times s$. $E \in \reals^{pc\times qs}$ is a general block sparse matrix, with a block of size $c\times s$ for each observation. Let us now block partition $\Delta x = [\Delta y,\Delta z]$ and $g=[v,w]$ to restate~\eqref{eq:normal} as the block structured linear system
306 is direct factorization, where we store and factor $S$ as a dense
345 The convergence rate of Conjugate Gradients for solving~\eqref{eq:normal} depends on the distribution of eigenvalues of $H$~\cite{saad2003iterative}. A useful upper bound is $\sqrt{\kappa(H)}$, where, $\kappa(H)$f is the condition number of the matrix $H$. For most bundle adjustment problems, $\ka (…)
[all...] |
| /external/webkit/Source/WebCore/manual-tests/inspector-wrappers/ |
| inspector-wrappers-test-utils.js | 19 "to make a cross-domain XMLHttpRequest. Where " +
|
| /ndk/sources/host-tools/make-3.81/ |
| configure.bat | 27 rem Where is the srcdir?
|
| /external/webkit/LayoutTests/dom/xhtml/level3/core/ |
| textreplacewholetext06.js | 86 Where the nodes to be removed are read-only descendants of an EntityReference, the EntityReference
|
| /ndk/build/core/ |
| main.mk | 46 # located in apps/<name> where <name> is a liberal name that doesn't
134 # Where all app-specific generated files will be stored
|
| definitions.mk | 57 # 2: file where the variable(s) should be defined
129 # @<listfile> syntax, where <listfile> is the path of a file
361 # MAKEFILE -> The Android.mk where the module is defined.
418 # LOCAL_OBJS_DIR will contain the location where the object files for
424 # where <prefix> and <suffix> depend on the module class.
[all...] |
| /external/bison/doc/ |
| refcard.tex | 331 otherwise it will have the format {\tt {\it name}.tab.h}, where
351 \key{Tell {\tt bison} where to start parsing.}
411 Where {\it statements} can be either empty, or contain
452 Where {\it t} is a type defined in the {\tt \%union}, {\it n} is a
|
| /external/v8/src/ |
| serialize.h | 216 // Where the pointed-to object can be found:
217 enum Where {
243 // Where to point within the object.
483 int index, HeapObject* object, HowToCode how, WhereToPoint where);
|
| /external/iproute2/doc/ |
| api-ip6-flowlabels.tex | 91 It was proposed (Where? I do not remember any explicit statement)
|
| /external/qemu/distrib/sdl-1.2.15/src/video/x11/ |
| SDL_x11video.c | 305 #error Where can we find the executable name?
[all...] |
| /external/dropbear/libtomcrypt/ |
| crypt.tex | 155 without having to use configure scripts. This means that the library will work with platforms where development
320 must pass it the length of the buffer where the output will be stored. For example:
396 special care to work properly on platforms where an \textit{unsigned char} is not eight bits.
515 &skey) /* where to put the scheduled key */
548 example, if you have $\mbox{Pr}\left[X = 1\right] = {1 \over 2} \pm \gamma$ where $\vert \gamma \vert > 0$ then the
588 Where \textit{name} is the lower case ASCII version of the name. The fields \textit{min\_key\_length} and \textit{max\_key\_length}
692 the location in the array where the cipher was found. For example, to indirectly setup Blowfish you can also use:
[all...] |
| /external/dropbear/libtommath/ |
| bn.tex | 163 However, there are cases where such a build is not optional. For instance, you want to perform RSA operations. You
252 function per source file and often I use a ``middle-road'' approach where I don't cut corners for an extra 2\% speed
284 So it may feel tempting to just rip the math code out of GnuPG (or GnuMP where it was taken from originally) in your
346 Where ``mp\_digit'' is a data type that represents individual digits of the integer. By default, an mp\_digit is the
548 When an mp\_int is in a state where it won't be changed again\footnote{A Diffie-Hellman modulus for instance.} excess
[all...] |
| /external/chromium/chrome/browser/resources/ |
| new_new_tab.js | 512 // TODO(aa): Where does this come from? It is the difference between what
[all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tree.pas | 254 /// display routine in BaseRecognizer needs to display where the
263 /// Where are the bounds in the input token stream for this node and
350 /// Get tree node at current input pointer + i ahead where i=1 is next node.
392 /// Where is this stream pulling nodes from? This is not the name, but
661 /// This is a variant of createToken where the new token is derived from
758 /// Where is this stream pulling nodes from? This is not the name, but
[all...] |
| Antlr.Runtime.pas | 73 /// Get int at current input pointer + I ahead (where I=1 is next int)
75 /// LA(-i) where i is before first token should yield -1, invalid char or EOF.
93 /// Return the current input symbol index 0..N where N indicates the
179 /// Where are you getting symbols from? Normally, implementations will
307 /// Where are you getting tokens from? normally the implication will simply
323 /// Get Token at current input pointer + I ahead (where I=1 is next
541 /// The index into the input stream where the last error occurred.
544 /// This is used to prevent infinite loops where an error is found
[all...] |
| /external/v8/test/mjsunit/ |
| unicode-test.js | [all...] |
