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

1 2

  /development/tools/line_endings/
Android.mk 3 # Copies files into the directory structure described by a manifest
  /build/tools/atree/
Android.mk 3 # Copies files into the directory structure described by a manifest
  /frameworks/base/tools/aidl/
Android.mk 3 # Copies files into the directory structure described by a manifest
  /external/webkit/LayoutTests/dom/html/level2/html/
HTMLScriptElement06.js 78 htmlFor is described as for future use. Test accesses the value, but makes no assertions about its value.
HTMLScriptElement07.js 78 event is described as for future use. Test accesses the value, but makes no assertions about its value.
  /external/webkit/LayoutTests/dom/xhtml/level2/html/
HTMLScriptElement06.js 78 htmlFor is described as for future use. Test accesses the value, but makes no assertions about its value.
HTMLScriptElement07.js 78 event is described as for future use. Test accesses the value, but makes no assertions about its value.
  /external/valgrind/main/coregrind/m_debuginfo/
debuginfo.c 605 in. Returns a ULong whose purpose is described in comments
3139 XArray* described = ML_(describe_type)( &residual_offset, local
3247 XArray* described = ML_(describe_type)( &residual_offset, local
    [all...]
  /ndk/sources/host-tools/nawk-20071023/
README 25 This is the version of awk described in "The AWK Programming Language",
  /external/libvorbis/doc/
01-introduction.tex 118 reference Vorbis decoder described below may be considered a proper
282 encoding and proper use of the comment header is described in \xref{vorbis:spec:comment}.
320 of the three Vorbis headers described above. The fourth packet type
336 as described earlier, all of which may be used in a given Vorbis
401 or angle. The coupling relationships are described in the codec setup
08-residue.tex 352 Format zero decodes partitions exactly as described earlier in the
386 Format 1 decodes partitions exactly as described earlier in the
431 \item Post decode: Deinterleave the single vector \varname{[v]} returned by format 1 decode as described above into \emph{ch} independent vectors, one for each outputchannel, according to:
07-floor1.tex 87 behavior is used for actual decode, as described later. The actual
04-codec.tex 572 function used for the MDCT is the function described earlier.
  /external/ceres-solver/docs/
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}}.
solving.tex 104 \texttt{TRADITIONAL\_DOGLEG} as described by Powell,
189 Note that the basic trust-region algorithm described in
204 enables the non-monotonic trust region algorithm as described by
216 Recall that in both of the trust-region methods described above, the key computational cost is the solution of a linear least squares problem of the form
356 For bundle adjustment problems arising in reconstruction from community photo collections, more effective preconditioners can be constructed by analyzing and exploiting the camera-point visibility structure of the scene~\cite{kushal2012}. Ceres implements the two visibility based preconditioners described by Kushal \& Agarwal as \texttt{CLUSTER\_JACOBI} and \texttt{CLUSTER\_TRIDIAGONAL}. These are fairly new preconditioners and Ceres' implementation of them is in its early stages and is not as mature as the other preconditioners described above.
442 \texttt{SUBSPACE\_DOGLEG} method described by Byrd et al.
    [all...]
modeling.tex 245 Here are some common loss functions implemented in Ceres. For simplicity we described their unscaled versions. Figure~\ref{fig:loss} illustrates their shape graphically.
  /external/valgrind/main/none/tests/
cmdline1.stdout.exp 41 --suppressions=<filename> suppress errors described in <filename>
cmdline2.stdout.exp 41 --suppressions=<filename> suppress errors described in <filename>
  /external/iproute2/doc/
ip-cref.tex 798 described below) is pretty dangerous. If you make a mistake, it will
805 in the format described in the previous subsection.
    [all...]
  /ndk/build/core/
init.mk 375 # case our automatic substitution function (described below) doesn't work.
  /external/blktrace/btt/doc/
btt.tex 456 described in section~\ref{sec:iostat}.
464 on a per-IO basis can be generated. These are described in
    [all...]
  /external/v8/benchmarks/
deltablue.js 33 * algorithm, as described in:
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/
v8-deltablue.js 27 * algorithm, as described in:
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/
v8-deltablue.js 27 * algorithm, as described in:
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/
v8-deltablue.js 27 * algorithm, as described in:

Completed in 558 milliseconds

1 2