/external/libopus/include/ |
opus.h | [all...] |
/external/llvm/include/llvm/Analysis/ |
LazyCallGraph.h | 71 /// Within this constraint, the desire is to minimize the merge points of the 694 /// effort has been made to minimize the overhead of common cases such as [all...] |
/external/python/cpython2/Tools/unicode/ |
makeunicodedata.py | 690 # the magic number 47 was chosen to minimize the number of [all...] |
/external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/ |
PathProfiling.cpp | 197 // implementation does not try to minimize the instrumentation overhead 577 // implementation does not try to minimize the instrumentation overhead [all...] |
/external/tensorflow/tensorflow/contrib/cudnn_rnn/python/kernel_tests/ |
cudnn_rnn_test.py | 364 train_op = optimizer.minimize(loss) 782 train_op = optimizer.minimize(loss_op) [all...] |
/external/tensorflow/tensorflow/contrib/slim/ |
README.md | 422 The loss function defines a quantity that we want to minimize. For 751 For example, we might want to minimize log loss, but our metrics of interes [all...] |
/external/tensorflow/tensorflow/docs_src/tutorials/ |
layers.md | 177 train_op = optimizer.minimize( 530 train_op = optimizer.minimize(
|
/external/webp/ |
README | 452 -min_size ............ minimize size 487 -min_size .............. minimize output size (default:off)
|
/libcore/ojluni/src/main/java/sun/misc/ |
FpUtils.java | 466 * are tradeoffs in writing a method to minimize the worst case 467 * performance and writing a method to minimize the time for [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/pulse/ |
stream.h | 96 * target buffer fill level possible to minimize the 126 * minimize the number of necessary wakeups and [all...] |
/prebuilts/jdk/jdk8/darwin-x86/jre/lib/ |
resources.jar | |
/prebuilts/jdk/jdk8/linux-x86/jre/lib/ |
resources.jar | |
/art/dexlayout/ |
compact_dex_writer.cc | 433 // Write code item first to minimize the space required for encoded methods.
|
/art/runtime/ |
subtype_check.h | 179 * Leveraging truncated paths to minimize path lengths.
|
/cts/tests/camera/src/android/hardware/camera2/cts/ |
SurfaceViewPreviewTest.java | 207 // Don't need image data, just drop it right away to minimize overhead [all...] |
/cts/tests/camera/src/android/hardware/cts/ |
CameraGLTest.java | 312 /** Generic camera test runner, to minimize boilerplace duplication */ [all...] |
/dalvik/docs/ |
dexopt.html | 20 processes to minimize total system memory usage.
|
/development/samples/devbytes/animation/ListViewExpandingCells/src/com/example/android/expandingcells/ |
ExpandingListView.java | 356 * 1. Update the layout parameters of the view clicked so as to minimize its height
|
/device/google/contexthub/firmware/os/algos/calibration/over_temp/ |
over_temp_cal.h | 53 * e) Offset Update Rate Limits - To minimize computational burden, a
|
/device/linaro/bootloader/arm-trusted-firmware/docs/ |
xlat-tables-lib-v2-design.rst | 335 By default [#granularity-ref]_, the algorithm will attempt to minimize the
|
/external/ImageMagick/ImageMagick/script/ |
quantize.html | 79 <p>Classification builds a color description tree for the image. Reduction collapses the tree until the number it represents, at most, is the number of colors desired in the output image. Assignment defines the output image's color map and sets each pixel's color by reclassification in the reduced tree. <var>Our goal is to minimize the numerical discrepancies between the original colors and quantized colors</var>. To learn more about quantization error, see <a href="quantize.php#measure">Measuring Color Reduction Error</a>.</p>
|
/external/ImageMagick/www/Magick++/ |
Exception.html | 23 instantiating the image object), you can minimize the overhead of
|
/external/ImageMagick/www/ |
quantize.html | 83 <p>Classification builds a color description tree for the image. Reduction collapses the tree until the number it represents, at most, is the number of colors desired in the output image. Assignment defines the output image's color map and sets each pixel's color by reclassification in the reduced tree. <var>Our goal is to minimize the numerical discrepancies between the original colors and quantized colors</var>. To learn more about quantization error, see <a href="quantize.html#measure">Measuring Color Reduction Error</a>.</p>
|
/external/antlr/antlr-3.4/runtime/C/include/ |
antlr3collections.h | 81 * to minimize this, but that seems over the top for what this is needed for.
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/linear/ |
SimplexTableau.java | 103 * or {@link GoalType#MINIMIZE}
|