/external/opencv/cv/include/ |
cv.h | 328 int iterations CV_DEFAULT(1) ); 334 int iterations CV_DEFAULT(1) ); 345 int operation, int iterations CV_DEFAULT(1) ); 484 Also it does several iterations to get optical flow for [all...] |
/external/opencv/cvaux/src/ |
cvlmeds.cpp | 936 int iterations, error = 0, jN, iN, kN, lN = 0; local 943 /* max_iterations - maximum number QR-iterations 1173 /* Iterations QR-algorithm for bidiagonal matrixes 1182 iterations = 0; 1253 Iterations of the process of the persecution 1264 /* Completion iterations: lower block 1267 if( iterations++ == max_iterations ) [all...] |
/external/ceres-solver/docs/ |
build.tex | 107 This runs Ceres for a maximum of 10 iterations using the \denseschur\ linear solver. The output should look something like this. 137 Number of iterations:
|
powell.tex | 96 Ceres Solver Report: Iterations: 12, Initial cost: 1.075000e+02, \ 100 It is easy to see that the optimal solution to this problem is at $x_1=0, x_2=0, x_3=0, x_4=0$ with an objective function value of $0$. In 10 iterations, Ceres finds a solution with an objective function value of $4\times 10^{-12}$.
|
solving.tex | 119 \subsection{Inner Iterations} 210 ones corresponding to the minimum cost over all iterations. 454 iterations for Levenberg-Marquardt. [all...] |
/external/chromium/chrome/common/extensions/docs/examples/extensions/proxy_configuration/test/ |
jsunittest.js | 955 DrNicTest.Unit.Testcase.prototype.benchmark = function(operation, iterations) { [all...] |
/external/netperf/ |
netcpu_ntperf.c | 145 calibrate_idle_rate(int iterations, int interval)
|
/external/webkit/Tools/Scripts/webkitpy/tool/commands/ |
queues_unittest.py | 86 queue._options.iterations = 3
|
/external/chromium/base/third_party/nspr/ |
prtime.cc | 536 int iterations = 0; local 544 if (iterations++ > 1000) [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
OrderingTest.java | 528 int iterations, int elements, int seeds) { 532 for (int i = 0; i < iterations; i++) {
|
/external/icu4c/test/perf/howExpensiveIs/ |
howExpensiveIs.cpp | 27 #ifndef ITERATIONS 28 #define ITERATIONS 5 59 fprintf(stderr, "** Standard sieve time: %.9fs +/- %.9fs (%d iterations)\n", s,m, (int)U_LOTS_OF_TIMES); 150 * @return number of iterations 168 double times[ITERATIONS]; 170 for(int i=0;i<ITERATIONS;i++) { 173 fprintf(stderr, "trial: %d/%d = %.9fs\n", i, ITERATIONS,times[i]); 177 uint32_t iterations = ITERATIONS; local 178 *subTime = uprv_getMeanTime(times,&iterations,marginOfError) [all...] |
/frameworks/base/tests/StatusBar/src/com/android/statusbartest/ |
NotificationTestList.java | [all...] |
/external/v8/benchmarks/ |
base.js | 222 // If we've run too few iterations, we continue for another second.
|
/external/yaffs2/yaffs2/ |
yaffs_guts.c | 2028 int iterations; local [all...] |
/external/icu4c/i18n/ |
decNumber.c | 5296 Int iterations=0; \/* for later sanity check *\/ local 5648 Int iterations=0; \/* for later sanity check *\/ local [all...] |
/external/blktrace/btreplay/doc/ |
btreplay.tex | 392 [ -I <iters>: --iterations=<iters> ] Default: 1 458 \texttt{--iterations}\\Set Number of Iterations to Run}
|
/external/libvpx/libvpx/vp8/common/ppc/ |
loopfilter_filters_altivec.asm | 92 ;# 4 iterations of the cyclic transform 0->1->2->3->4->5->6->7->0. 236 ;# This can be accomplished by 4 iterations of the cyclic transform [all...] |
/external/libvpx/libvpx/vp8/common/x86/ |
subpixel_mmx.asm | 189 ; the subsequent iterations repeat 3 out of 4 of these reads. Since the
|
/external/v8/test/mjsunit/ |
regexp.js | 528 // More iterations increases the chance of hitting a GC.
|
/external/wpa_supplicant_8/src/crypto/ |
crypto_openssl.c | 685 int iterations, u8 *buf, size_t buflen)
|
/external/guava/guava-tests/test/com/google/common/cache/ |
CacheLoadingTest.java | 1626 int iterations = 10; local [all...] |
/external/icu4c/test/intltest/ |
numfmtst.cpp | [all...] |
/prebuilts/devtools/tools/lib/ |
ddmlib.jar | |
/prebuilts/misc/common/ddmlib/ |
ddmlib-prebuilt.jar | |
/external/v8/test/cctest/ |
test-api.cc | [all...] |