| /external/ceres-solver/docs/ |
| ceres-solver.tex | 104 Building this pdf from source requires a relatively recent installation of \texttt{LaTeX}~\footnote{\url{http://www.tug.org/texlive/}}, \texttt{minted.sty}\footnote{\url{http://code.google.com/p/minted/}} and \texttt{pygments}\footnote{\url{http://pygments.org/}}.
|
| build.tex | 11 \item{\cmake~\footnote{\url{http://www.cmake.org/}}} is the cross-platform build system used by Ceres. We require that you have a relative recent install of \texttt{cmake} (version 2.8.0 or better).
12 \item{\eigen~\footnote{\url{http://eigen.tuxfamily.org}}} is used for doing all the low level matrix and
15 \item{\glog~\footnote{\url{http://code.google.com/p/google-glog}}} is used for error checking and logging.
19 \item{\gflags~\footnote{\url{http://code.google.com/p/gflags}}} is used by the code in
22 \item{\suitesparse~\footnote{\url{http://www.cise.ufl.edu/research/sparse/SuiteSparse/}}} is used for sparse matrix analysis,
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.
32 \texttt{GotoBlas2}~\footnote{\url{http://www.tacc.utexas.edu/tacc-projects/gotoblas2}}
34 \texttt{ATLAS}~\footnote{\url{http://math-atlas.sourceforge.net/}},
37 \item{\texttt{protobuf}~\footnote{\url{http://code.google.com/p/protobuf/}}} is an optional dependency that is used for serializing and deserializing linear least squares problems to disk. This is useful for debugging and testing. Without it, some of the tests will be disabled.
150 On OS X, we recommend using the \texttt{homebrew}~\footnote{\url{http://mxcl.github.com/homebrew/}} package manager
[all...] |
| introduction.tex | 4 Ceres Solver\footnote{For brevity, in the rest of this document we will just use the term Ceres.} is a non-linear least squares solver developed at Google. It is designed to solve small and large sparse problems accurately and efficiently~\footnote{For a gentle but brief introduction to non-liner least squares problems, please start by reading the~\hyperref[part:tutorial]{Tutorial}}. Amongst its various features is a simple but expressive API with support for automatic differentiation, robust norms, local parameterizations, automatic gradient checking, multithreading and automatic problem structure detection.
16 We welcome contributions to Ceres, whether they are new features, bug fixes or tests. The Ceres mailing list\footnote{\url{http://groups.google.com/group/ceres-solver}} is the best place for all development related discussions. Please consider joining it. If you have ideas on how you would like to contribute to Ceres, it is a good idea to let us know on the mailinglist before you start development. We may have suggestions that will save effort when trying to merge your work into the main branch. If you are looking for ideas, please let us know about your interest and skills and we will be happy to make a suggestion or three.
18 We follow Google's C++ Style Guide~\footnote{\url{http://google-styleguide.googlecode.com/svn/trunk/cppguide.xml}} and use \texttt{git} for version control.
|
| helloworld.tex | 8 This is a trivial problem, whose minimum is easy to see is located at $x = 10$, but it is a good place to start to illustrate the basics of solving a problem with Ceres\footnote{Full working code for this and other examples in this manual can be found in the \texttt{examples} directory. Code for this example can be found in \texttt{examples/quadratic.cc}}.
71 Starting from a $x=5$, the solver in two iterations goes to 10~\footnote{Actually the solver ran for three iterations, and it was by looking at the value returned by the linear solver in the third iteration, it observed that the update to the parameter block was too small and declared convergence. Ceres only prints out the display at the end of an iteration, and terminates as soon as it detects convergence, which is why you only see two iterations here and not three.}. The careful reader will note that this is a linear problem and one linear solve should be enough to get the optimal value. The default configuration of the solver is aimed at non-linear problems, and for reasons of simplicity we did not change it in this example. It is indeed possible to obtain the solution to this problem using Ceres in one iteration. Also note that the solver did get very close to the optimal function value of 0 in the very first iteration. We will discuss these issues in greater detail when we talk about convergence and parameter settings for Ceres.
|
| nnlsq.tex | 11 is a Non-linear least squares problem~\footnote{Ceres can solve a more general version of this problem, but for pedagogical reasons, we will restrict ourselves to this class of problems for now. See section~\ref{chapter:overview} for a full description of the problems that Ceres can solve}. Here $\|\cdot\|$ denotes the Euclidean norm of a vector.
|
| bundleadjustment.tex | 8 Let us consider the solution of a problem from the BAL~\cite{Agarwal10bal} dataset~\footnote{The code for this example can be found in \texttt{examples/simple\_bundle\_adjuster.cc}.}.
16 homepage~\footnote{\url{http://phototour.cs.washington.edu/bundler/}}
18 homepage~\footnote{\url{http://grail.cs.washington.edu/projects/bal/}}.
|
| curvefitting.tex | 4 The examples we have seen until now are simple optimization problems with no data. The original purpose of least squares and non-linear least squares analysis was fitting curves to data. It is only appropriate that we now consider an example of such a problem\footnote{The full code and data for this example can be found in
|
| faq.tex | 60 Not at this time. We have some ideas on how to do this, but we have not had very many requests to justify the effort involved. If you have a problem that requires such a functionality we would like to hear about it as it will help us decide directions for future work. In the meanwhile, if you are interested in solving bounds constrained problems, consider using some of the tricks described by John D'Errico in his fminsearchbnd toolkit~\footnote{\url{http://www.mathworks.com/matlabcentral/fileexchange/8277-fminsearchbnd}}.
|
| powell.tex | 62 and \texttt{F4}. Then let us consider the construction and solution of the problem. For brevity we only describe the relevant bits of code~\footnote{The full source code for this example can be found in \texttt{examples/powell.cc}.}
|
| solving.tex | 8 $ F(x) = \left[f_1(x), \hdots, f_{m}(x) \right]^{\top}$ be a $m$-dimensional function of $x$. We are interested in solving the following optimization problem~\footnote{At the level of the non-linear solver, the block and residual structure is not relevant, therefore our discussion here is in terms of an optimization problem defined over a state vector of size $n$.},
[all...] |
| /external/markdown/markdown/extensions/ |
| footnotes.py | 4 This section adds footnote handling to markdown. It can be used as
9 footnotes. All footnote functionality is provided separately and
12 Footnote functionality is attached by calling extendMarkdown()
20 [^1]: This is a footnote
21 [^label]: A footnote on "label"
22 [^!DEF]: The footnote for definition
35 """ Footnote Extension. """
60 md.preprocessors.add("footnote", FootnotePreprocessor(self),
64 md.inlinePatterns.add("footnote", FootnotePattern(FOOTNOTE_RE, self),
66 # Insert a tree-processor that would actually add the footnote di
[all...] |
| /external/libvpx/libvpx/examples/includes/PHP-Markdown-Extra-1.2.3/ |
| markdown.php | 29 # Optional title attribute for footnote links and backlinks.
33 # Optional class attribute for footnote links and backlinks.
104 # Add a footnote id prefix to posts when inside a loop.
2695 $footnote = reset($this->footnotes_ordered); variable
2700 $footnote = $this->runBlockGamut("$footnote\\n"); variable
2701 $footnote = preg_replace_callback('{F\\x1Afn:(.*?)\\x1A:}', variable
2710 $footnote = substr($footnote, 0, -4) . " $backlink<\/p>"; variable
[all...] |
| /packages/inputmethods/PinyinIME/src/com/android/inputmethod/pinyin/ |
| CandidateView.java | 63 * Whether footnotes are displayed. Footnote is shown when hardware keyboard
176 * Used to draw footnote.
507 String footnote = null; local
509 footnote = Integer.toString(i + 1);
510 footnoteSize = mFootnotePaint.measureText(footnote);
536 // Draw footnote
538 canvas.drawText(footnote, xPos + (candMargin - footnoteSize)
|
| /ndk/sources/host-tools/sed-4.2.1/build-aux/ |
| texi2dvi | 475 # Always use `end' footnote style, since the `separate' style
481 | $makeinfo --footnote-style=end -I "$filename_dir" $miincludes \
|
| texinfo.tex | 85 \let\ptexfootnote=\footnote
[all...] |
| /external/blktrace/btt/doc/ |
| btt.tex | 118 This is also broken down into two component times\footnote{On
139 Referred to as \emph{I2D} time\footnote{The \emph{issue} trace
159 of IOs during the run\footnote{One of the areas that needs some
171 example\footnote{As with this display, the author has taken some liberty
192 IO\footnote{It should be noted that incoming requests either go through:
481 xmgrace\footnote{\texttt{http://plasma-gate.weizmann.ac.il/Grace/}
570 some real-world analysis\footnote{Note the logarithmic nature of the
586 some real-world analysis\footnote{Note the logarithmic nature of the
[all...] |
| /external/blktrace/btreplay/doc/ |
| btreplay.tex | 49 \texttt{blktrace}\footnote{\texttt{git://git.kernel.dk/blktrace.git}}
135 kernel\footnote{Attempts to do them individually resulted in too large of a
161 while the other thread manages reclaiming AIOs completed\footnote{We
221 machine\footnote{The notion of an offset and device size to replay on
|
| /external/dropbear/libtommath/ |
| bn.tex | 90 Since both\footnote{Note that the MPI files under mtest/ are copyrighted by Michael Fromberger. They are not required to use LibTomMath.} are in the
136 results. ``mtest/mtest'' will generate test vectors using the MPI library by Michael Fromberger\footnote{A copy of MPI
259 are the pros and cons of LibTomMath by comparing it to the math routines from GnuPG\footnote{GnuPG v1.2.3 versus LibTomMath v0.28}.
416 pointer\footnote{The ``dp'' member.} within the mp\_int to \textbf{NULL} which is used to prevent double free situations.
548 When an mp\_int is in a state where it won't be changed again\footnote{A Diffie-Hellman modulus for instance.} excess
856 If this program\footnote{This function uses the mp\_neg() function which is discussed in section \ref{sec:NEG}.} completes
914 If this program\footnote{This function uses the mp\_neg() function which is discussed in section \ref{sec:NEG}.} completes
[all...] |
| /external/grub/docs/ |
| texinfo.tex | 87 \let\ptexfootnote=\footnote
[all...] |
| /external/bison/build-aux/ |
| texinfo.tex | 84 \let\ptexfootnote=\footnote
[all...] |
| /external/dropbear/libtomcrypt/ |
| crypt.tex | 443 These two functions will encrypt or decrypt (respectively) a single block of text\footnote{The size of which depends on
445 the same buffer. For the encrypt function \textit{pt}\footnote{pt stands for plaintext.} is the input and
446 \textit{ct}\footnote{ct stands for ciphertext.} is the output. For the decryption function it's the opposite. They both
447 return \textbf{CRYPT\_OK} on success. To test a particular cipher against test vectors\footnote{As published in their design papers.}
[all...] |
| /external/iproute2/doc/ |
| ip-tunnels.tex | 186 that base device or fallback tunnel cannot be replicated.\footnote{
|
| /external/e2fsprogs/lib/et/ |
| texinfo.tex | [all...] |
| /external/blktrace/doc/ |
| blktrace.tex | 120 each boot\footnote{Note: after adding the entry to /etc/fstab, you
[all...] |
