HomeSort by relevance Sort by last modified time
    Searched full:minimize (Results 501 - 525 of 1660) sorted by null

<<21222324252627282930>>

  /prebuilts/clang/host/linux-x86/clang-4630689/prebuilt_include/llvm/lib/Fuzzer/
FuzzerFlags.def 40 "This flag can be used to minimize a corpus.")
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/
ExecutionDepsFix.h 19 /// This pass changes the variant instructions to minimize domain crossings.
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Transforms/IPO/
LowerTypeTests.h 91 /// By starting with the smallest fragments, we minimize the size of the
  /prebuilts/clang/host/linux-x86/clang-4639204/prebuilt_include/llvm/lib/Fuzzer/
FuzzerFlags.def 40 "This flag can be used to minimize a corpus.")
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/
ExecutionDepsFix.h 19 /// This pass changes the variant instructions to minimize domain crossings.
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Transforms/IPO/
LowerTypeTests.h 91 /// By starting with the smallest fragments, we minimize the size of the
  /prebuilts/clang/host/linux-x86/clang-4691093/prebuilt_include/llvm/lib/Fuzzer/
FuzzerFlags.def 40 "This flag can be used to minimize a corpus.")
  /prebuilts/go/darwin-x86/src/cmd/asm/internal/arch/
arm.go 6 // instruction set, to minimize its interaction with the core of the
  /prebuilts/go/linux-x86/src/cmd/asm/internal/arch/
arm.go 6 // instruction set, to minimize its interaction with the core of the
  /prebuilts/misc/darwin-x86_64/freetype/include/freetype2/
ftcffdrv.h 110 * to minimize distortion.
  /sdk/find_java2/src/
FindJava2Dlg.cpp 82 // If you add a minimize button to your dialog, you will need the code below
  /system/netd/server/dns/
README.md 42 annotations) to minimize the likelihood of a latent threading bug. The unit tests are
  /tools/tradefederation/core/util-apps/WifiUtil/src/com/android/tradefed/utils/wifi/
WifiMonitorService.java 108 // Catching exceptions to prevent crash and minimize impacts on running tests.
  /external/ImageMagick/ImageMagick/api/
quantize.html 69 <p>The basic algorithm operates in three phases: Classification, Reduction, and Assignment. Classification builds a color description tree for the image. Reduction collapses the tree until the number it represents, at most, the number of colors desired in the output image. Assignment defines the output image's color map and sets each pixel's color by restorage_class in the reduced tree. Our goal is to minimize the numerical discrepancies between the original colors and quantized colors (quantization error).</p>
304 <p>QuantizeImage() analyzes the colors within a reference image and chooses a fixed number of colors to represent the image. The goal of the algorithm is to minimize the color difference between the input and output image while minimizing the processing time.</p>
335 <p>QuantizeImages() analyzes the colors within a set of reference images and chooses a fixed number of colors to represent the set. The goal of the algorithm is to minimize the color difference between the input and output images while minimizing the processing time.</p>
  /external/ImageMagick/www/api/
quantize.html 73 <p>The basic algorithm operates in three phases: Classification, Reduction, and Assignment. Classification builds a color description tree for the image. Reduction collapses the tree until the number it represents, at most, the number of colors desired in the output image. Assignment defines the output image's color map and sets each pixel's color by restorage_class in the reduced tree. Our goal is to minimize the numerical discrepancies between the original colors and quantized colors (quantization error).</p>
308 <p>QuantizeImage() analyzes the colors within a reference image and chooses a fixed number of colors to represent the image. The goal of the algorithm is to minimize the color difference between the input and output image while minimizing the processing time.</p>
339 <p>QuantizeImages() analyzes the colors within a set of reference images and chooses a fixed number of colors to represent the set. The goal of the algorithm is to minimize the color difference between the input and output images while minimizing the processing time.</p>
quantize.php 69 <p>The basic algorithm operates in three phases: Classification, Reduction, and Assignment. Classification builds a color description tree for the image. Reduction collapses the tree until the number it represents, at most, the number of colors desired in the output image. Assignment defines the output image's color map and sets each pixel's color by restorage_class in the reduced tree. Our goal is to minimize the numerical discrepancies between the original colors and quantized colors (quantization error).</p>
304 <p>QuantizeImage() analyzes the colors within a reference image and chooses a fixed number of colors to represent the image. The goal of the algorithm is to minimize the color difference between the input and output image while minimizing the processing time.</p>
335 <p>QuantizeImages() analyzes the colors within a set of reference images and chooses a fixed number of colors to represent the set. The goal of the algorithm is to minimize the color difference between the input and output images while minimizing the processing time.</p>
  /external/python/cpython2/Doc/library/
test.rst 130 as what type of input is used. Minimize code duplication by subclassing a
168 -m test.regrtest test_spam`) will minimize output and only print whether
169 the test passed or failed and thus minimize output.
  /external/swiftshader/third_party/LLVM/docs/
SystemLibrary.html 25 <li><a href="#softerrors">Minimize Soft Errors</a></li>
198 <h3><a name="softerrors">Minimize Soft Errors</a></h3>
208 <p>lib/System must always attempt to minimize soft errors.
  /external/tensorflow/tensorflow/contrib/kfac/python/ops/
optimizer.py 174 def minimize(self, *args, **kwargs): member in class:KfacOptimizer
179 return super(KfacOptimizer, self).minimize(*args, **kwargs)
303 More specifically, if L is the loss we minimize a quadratic approximation
  /external/tensorflow/tensorflow/docs_src/programmers_guide/
low_level_intro.md 524 variable in order to minimize the loss. The simplest optimization algorithm is
532 train = optimizer.minimize(loss)
575 train = optimizer.minimize(loss)
  /frameworks/base/packages/SystemUI/src/com/android/systemui/pip/phone/
PipTouchHandler.java 653 // Track if movement remains near starting edge to identify swipes to minimize
710 // minimize offset adjusted
719 // If we're dragging and it wasn't a minimize gesture then we shouldn't be
    [all...]
  /external/pcre/dist2/src/
pcre2_match.c 349 so as to minimize the number of holes. */
591 BOOL minimize, possessive; /* Quantifier options */ local
797 minimize = possessive = FALSE;
    [all...]
  /art/dexoptanalyzer/
dexoptanalyzer.cc 231 // ISA image and minimize the amount of things that get started.
  /bionic/libm/upstream-freebsd/lib/msun/src/
s_expm1.c 55 * specific way which minimize the accumulation rounding error:
  /developers/build/prebuilts/gradle/BasicSyncAdapter/Application/src/main/java/com/example/android/basicsyncadapter/
SyncAdapter.java 185 * minimize (expensive) disk operations, we compare incoming data with what's already in our

Completed in 728 milliseconds

<<21222324252627282930>>