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

<<21222324252627282930>>

  /device/linaro/bootloader/edk2/MdePkg/Include/Protocol/
Hash2.h 38 // Algorithms EFI_HASH_ALGORITHM_SHA1_NOPAD and
46 // New driver implementations are encouraged to consider stronger algorithms.
  /external/ImageMagick/ImageMagick/script/
distribute-pixel-cache.html 65 <p>Your image processing tasks are likely to perform slower when utilizing a distributed pixel cache due to pixels shuffling between the client and the server over a network. Algorithms that access virtual pixels (e.g. -sharpen) are noticeably slower, up to 3 times slower, than algorithms that only access authentic pixels (e.g. -negate) due to increased network traffic.</p>
openmp.html 56 <p class="lead magick-description">Many of ImageMagick's internal algorithms are threaded to take advantage of speed-ups offered by the multicore processor chips and <a href="http://www.openmp.org">OpenMP</a>. OpenMP, is an API specification for parallel programming. If your compiler supports OpenMP (e.g. gcc, Visual Studio 2005) directives, ImageMagick automatically includes support. To verify, look for the OpenMP feature of ImageMagick with this command:</p>
63 <p>With OpenMP enabled, most ImageMagick algorithms execute on all the cores on your system in parallel. ImageMagick typically divides the work so that each thread processes four rows of pixels. As rows are completed, OpenMP assigns more chunks of pixel rows to each thread until the algorithm completes. For example, if you have a quad-core system, and attempt to resize an image, the resizing takes place on 4 cores (8 if hyperthreading is enabled).</p>
  /external/ImageMagick/config/
ImageMagick.rdf.in 43 Threads of execution support: ImageMagick is thread safe and most internal algorithms execute in parallel to take advantage of speed-ups offered by multicore processor chips.
44 Heterogeneous distributed processing: certain algorithms are OpenCL-enabled to take advantage of speed-ups offered by executing in concert across heterogeneous platforms consisting of CPUs, GPUs, and other processors.
  /external/ImageMagick/www/Magick++/
Documentation.html 14 <p>The core class in Magick++ is the <a href="Image++.html">Image</a> class. The Image class provides methods to manipulate a single image frame (e.g. a JPEG image). Standard Template Library (STL)<span lang="en-US">compatible</span> <a href="STL.html">algorithms and function objects</a> are provided in order to manipulate multiple image frames or to read and write file formats which support multiple image frames (e.g. GIF animations, MPEG animations, and Postscript files).</p>
56 <td>STL algorithms and function objects for operating on
  /external/ImageMagick/www/
distribute-pixel-cache.html 69 <p>Your image processing tasks are likely to perform slower when utilizing a distributed pixel cache due to pixels shuffling between the client and the server over a network. Algorithms that access virtual pixels (e.g. -sharpen) are noticeably slower, up to 3 times slower, than algorithms that only access authentic pixels (e.g. -negate) due to increased network traffic.</p>
openmp.html 60 <p class="lead magick-description">Many of ImageMagick's internal algorithms are threaded to take advantage of speed-ups offered by the multicore processor chips and <a href="http://www.openmp.org">OpenMP</a>. OpenMP, is an API specification for parallel programming. If your compiler supports OpenMP (e.g. gcc, Visual Studio 2005) directives, ImageMagick automatically includes support. To verify, look for the OpenMP feature of ImageMagick with this command:</p>
67 <p>With OpenMP enabled, most ImageMagick algorithms execute on all the cores on your system in parallel. ImageMagick typically divides the work so that each thread processes four rows of pixels. As rows are completed, OpenMP assigns more chunks of pixel rows to each thread until the algorithm completes. For example, if you have a quad-core system, and attempt to resize an image, the resizing takes place on 4 cores (8 if hyperthreading is enabled).</p>
  /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/jacobians/
StepInterpolatorWithJacobians.java 29 * objects tightly bound to the integrator internal algorithms. The
77 * added to simplify implementation of search algorithms near the
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/symmetric/util/
BaseStreamCipher.java 18 // Android-removed: Unsupported algorithms
39 // Android-removed: Unsupported algorithms
  /external/eigen/Eigen/src/SparseCore/
CompressedStorage.h 153 // (very common in high level algorithms)
166 // (very common in high level algorithms)
  /external/libjpeg-turbo/
jdct.h 13 * (jcdctmgr.c, jddctmgr.c) and the individual DCT algorithms.
14 * The individual DCT algorithms are kept in separate files to ease
  /external/llvm/include/llvm/CodeGen/
GCStrategy.h 10 // GCStrategy coordinates code generation algorithms and implements some itself
12 // specified in a function's 'gc' attribute. Algorithms are enabled by setting
  /external/nist-sip/java/gov/nist/javax/sip/clientauthutils/
MessageDigestAlgorithm.java 20 * @param algorithm a string indicating a pair of algorithms (MD5 (default), or MD5-sess) used
94 * @param algorithm a string indicating a pair of algorithms (MD5 (default), or MD5-sess) used
  /external/pcre/dist2/doc/
pcre2.3 38 For a discussion of the two matching algorithms, see the
158 pcre2matching discussion of the two matching algorithms
  /external/python/cpython2/Modules/
_bisectmodule.c 1 /* Bisection algorithms. Drop in replacement for bisect.py
235 "Bisection algorithms.\n\
  /external/python/cpython3/Modules/
_bisectmodule.c 1 /* Bisection algorithms. Drop in replacement for bisect.py
239 "Bisection algorithms.\n\
  /external/vboot_reference/tests/
vb21_common2_tests.c 285 /* Test only the algorithms we use */
303 /* Test all the algorithms */
  /external/wycheproof/
README.md 30 cryptographic algorithms, including RSA, elliptic curve crypto and
50 Project Wycheproof has tests for the most popular crypto algorithms, including
  /libcore/luni/src/test/java/libcore/java/security/spec/
AlgorithmParametersPSSTest.java 212 // for digest algorithms and MGF algorithms.
  /libcore/ojluni/src/main/java/sun/security/pkcs/
PKCS7.java 598 * @exception NoSuchAlgorithmException on unrecognized algorithms.
614 * @exception NoSuchAlgorithmException on unrecognized algorithms.
628 * @exception NoSuchAlgorithmException on unrecognized algorithms.
654 * @exception NoSuchAlgorithmException on unrecognized algorithms.
672 * Returns the message digest algorithms specified in this PKCS7 block.
673 * @return the array of Digest Algorithms or null if none are specified
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
GCStrategy.h 10 // GCStrategy coordinates code generation algorithms and implements some itself
12 // specified in a function's 'gc' attribute. Algorithms are enabled by setting
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/
GCStrategy.h 10 // GCStrategy coordinates code generation algorithms and implements some itself
12 // specified in a function's 'gc' attribute. Algorithms are enabled by setting
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/
GCStrategy.h 10 // GCStrategy coordinates code generation algorithms and implements some itself
12 // specified in a function's 'gc' attribute. Algorithms are enabled by setting
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/
GCStrategy.h 10 // GCStrategy coordinates code generation algorithms and implements some itself
12 // specified in a function's 'gc' attribute. Algorithms are enabled by setting
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/CodeGen/
GCStrategy.h 10 // GCStrategy coordinates code generation algorithms and implements some itself
12 // specified in a function's 'gc' attribute. Algorithms are enabled by setting

Completed in 510 milliseconds

<<21222324252627282930>>