| /external/ceres-solver/docs/ |
| solving.tex | 158 This idea can be generalized to cases where the residual is not
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
[all...] |
| /external/chromium/chrome/browser/resources/ |
| menu.js | 301 * from the label in both cases.
|
| /external/iproute2/doc/ |
| api-ip6-flowlabels.tex | 181 In the cases when it is convenient to use \verb|recvfrom(2)|,
|
| /external/v8/src/ |
| runtime.js | 123 // Fast cases for string, numbers and undefined compares.
|
| v8natives.js | 814 // There are 3 cases that lead here:
838 // There are 3 cases that lead here:
[all...] |
| parser.cc | 2639 ZoneList<CaseClause*>* cases = new(zone()) ZoneList<CaseClause*>(4); local
[all...] |
| /external/v8/test/mjsunit/harmony/ |
| proxies-function.js | 631 // run through, but it currently fails on so many cases (some not even
|
| /dalvik/vm/mterp/mips/ |
| footer.S | 505 # (very few methods have > 10 args; could unroll for common cases)
[all...] |
| /system/core/sh/ |
| parser.c | 420 cpp = &n1->ncase.cases;
781 * In all cases, the variable startlinno is set to the number of the line
[all...] |
| /dalvik/vm/mterp/armv5te/ |
| footer.S | 489 @ (very few methods have > 10 args; could unroll for common cases)
[all...] |
| /external/blktrace/btreplay/doc/ |
| btreplay.tex | 183 outlined here, in some cases ideas on additions and/or improvements are
|
| /external/chromium/chrome/browser/resources/touch_ntp/ |
| newtab.js | 383 // cases.
|
| /external/chromium/chrome/common/extensions/docs/examples/extensions/benchmark/jst/ |
| jstemplate.js | 175 * be used for this node. This allows the reuse of cache entries in cases
[all...] |
| /external/chromium/chrome/common/extensions/docs/examples/extensions/irc/servlet/jstemplate/ |
| jstemplate.js | 175 * be used for this node. This allows the reuse of cache entries in cases
[all...] |
| /external/eigen/blas/testing/ |
| cblat1.f | 28 * detailed output, if any, for cases that do not involve
|
| dblat1.f | 28 * .. detailed output, if any, for cases that do not involve ..
|
| sblat1.f | 28 * .. detailed output, if any, for cases that do not involve ..
|
| zblat1.f | 28 * detailed output, if any, for cases that do not involve
|
| /external/libvorbis/doc/ |
| 01-introduction.tex | 459 depth in all cases because it happens to mostly work with the current
|
| 04-codec.tex | 547 depth in all cases because it happens to mostly work with the current
|
| /external/v8/benchmarks/ |
| deltablue.js | 789 * and executing a constraint satisfaction plan. There are two cases.
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
| v8-deltablue.js | 783 * and executing a constraint satisfaction plan. There are two cases.
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
| v8-deltablue.js | 783 * and executing a constraint satisfaction plan. There are two cases.
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
| v8-deltablue.js | 783 * and executing a constraint satisfaction plan. There are two cases.
|
| /external/dropbear/libtomcrypt/ |
| crypt.tex | [all...] |
