HomeSort by relevance Sort by last modified time
    Searched refs:Algorithm (Results 51 - 75 of 87) sorted by null

1 23 4

  /external/libchrome/crypto/
symmetric_key_win.cc 47 // key created for the specified |provider|. |alg| contains the algorithm of
318 SymmetricKey* SymmetricKey::GenerateRandomKey(Algorithm algorithm,
328 switch (algorithm) {
358 SymmetricKey* SymmetricKey::DeriveKeyFromPassword(Algorithm algorithm,
371 switch (algorithm) {
453 // Convert the derived key bytes into a key handle for the desired algorithm.
467 SymmetricKey* SymmetricKey::Import(Algorithm algorithm,
    [all...]
symmetric_key_unittest.cc 69 crypto::SymmetricKey::Algorithm algorithm; member in struct:PBKDF2TestVector
94 test_data.algorithm,
  /external/opencv3/modules/cudalegacy/include/opencv2/
cudalegacy.hpp 70 class CV_EXPORTS ImagePyramid : public Algorithm
82 /** @brief Background/Foreground Segmentation Algorithm.
86 class implements algorithm described in @cite Gold2012 .
141 algorithm described in @cite FGD2003 .
184 @param params Algorithm's parameters. See @cite FGD2003 for explanation.
193 //! Calculates optical flow for 2 images using block matching algorithm */
  /external/opencv3/modules/ml/test/
test_lr.cpp 8 // This is a implementation of the Logistic Regression algorithm in C++ in OpenCV.
25 // # Logistic Regression ALGORITHM
182 Ptr<LogisticRegression> lr2 = Algorithm::load<LogisticRegression>(filename);
test_emknearestkmeans.cpp 579 em = Algorithm::load<EM>(filename);
  /external/opencv3/modules/video/include/opencv2/video/
tracking.hpp 68 The function implements the CAMSHIFT object tracking algorithm @cite Bradski98 . First, it finds an
76 - (Python) A sample explaining the camshift tracking algorithm can be found at
86 @param criteria Stop criteria for the iterative search algorithm.
89 The function implements the iterative object search algorithm. It takes the input back projection of
93 than criteria.epsilon. The algorithm is used inside CamShift and, unlike CamShift , the search
109 @param winSize window size of optical flow algorithm. Must be not less than winSize argument of
144 algorithm will use as many levels as pyramids have but no more than maxLevel.
145 @param criteria parameter, specifying the termination criteria of the iterative search algorithm
155 @param minEigThreshold the algorithm calculates the minimum eigen value of a 2x2 normal matrix of
166 - An example using the Lucas-Kanade optical flow algorithm can be found a
    [all...]
  /external/lzma/CS/7zip/
ICoder.cs 129 /// Specifies number of algorithm.
131 Algorithm,
  /external/opencv3/modules/cudaarithm/include/opencv2/
cudaarithm.hpp 480 class CV_EXPORTS LookUpTable : public Algorithm
    [all...]
  /external/opencv3/modules/ml/include/opencv2/
ml.hpp 242 should cover all the variables. If varTypeSpec is not specified, then algorithm uses the
290 class CV_EXPORTS_W StatModel : public Algorithm
419 /** %Algorithm type, one of KNearest::Types. */
456 /** @brief Implementations of KNearest algorithm
483 class CV_EXPORTS Kernel : public Algorithm
636 subset is used to test the model, the others form the train set. So, the %SVM algorithm is
703 The function generates a grid for the specified parameter of the %SVM algorithm. The grid may be
718 /** @brief The class implements the Expectation Maximization algorithm.
    [all...]
  /external/opencv3/modules/cudafeatures2d/include/opencv2/
cudafeatures2d.hpp 75 class CV_EXPORTS DescriptorMatcher : public cv::Algorithm
  /external/opencv3/modules/features2d/include/opencv2/
features2d.hpp 132 class CV_EXPORTS_W Feature2D : public virtual Algorithm
249 described in @cite RRKB11 . The algorithm uses FAST in pyramids to detect stable keypoints, selects
281 @param scoreType The default HARRIS_SCORE means that Harris algorithm is used to rank features
322 The class encapsulates all the parameters of the MSER extraction algorithm (see
360 /** @brief Detects corners using the FAST algorithm
372 Detects corners using the FAST algorithm by @cite Rosten06 .
415 /** @brief Detects corners using the AGAST algorithm
427 Detects corners using the AGAST algorithm by @cite mair2010_agast .
490 The class implements a simple algorithm for extracting blobs from an image:
745 class CV_EXPORTS_W DescriptorMatcher : public Algorithm
    [all...]
  /external/v8/test/mjsunit/
md5.js 29 // Digest Algorithm, as defined in RFC 1321.
  /external/opencv3/modules/imgproc/include/opencv2/
imgproc.hpp 246 //! interpolation algorithm
315 THRESH_OTSU = 8, //!< flag, use Otsu algorithm to choose the optimal threshold value
316 THRESH_TRIANGLE = 16 //!< flag, use Triangle algorithm to choose the optimal threshold value
319 //! adaptive threshold algorithm
338 //! class of the pixel in GrabCut algorithm
346 //! GrabCut algorithm flags
349 runs iterCount iterations of the algorithm. */
355 /** The value means that the algorithm should just resume. */
359 //! distanceTransform algorithm flags
368 //! floodfill algorithm flag
    [all...]
  /external/opencv3/modules/objdetect/include/opencv2/
objdetect.hpp 79 classifiers, and are calculated as described below. The current algorithm uses the following
174 class CV_EXPORTS_W BaseCascadeClassifier : public Algorithm
  /external/lzma/CS/7zip/Compress/LzmaAlone/
LzmaAlone.cs 250 Int32 algorithm = 2;
256 if (!GetNumber((string)parser[(int)Key.Mode].PostStrings[0], out algorithm))
278 CoderPropID.Algorithm,
289 (Int32)(algorithm),
  /external/v8/test/webkit/fast/js/kde/
md5-1.js 31 * Message-Digest Algorithm.
148 /* Here begin the real algorithm */
377 /* End of the MD5 algorithm */
md5-2.js 29 * Digest Algorithm, as defined in RFC 1321.
55 * These functions implement the four basic operations the algorithm uses.
  /cts/apps/CtsVerifier/libs/
opencv3-android.jar 
  /external/opencv3/modules/calib3d/include/opencv2/
calib3d.hpp 185 //! type of the robust estimation algorithm
186 enum { LMEDS = 4, //!< least-median algorithm
187 RANSAC = 8, //!< RANSAC algorithm
188 RHO = 16 //!< RHO algorithm
231 //! the algorithm for finding fundamental matrix
232 enum { FM_7POINT = 1, //!< 7-point algorithm
233 FM_8POINT = 2, //!< 8-point algorithm
234 FM_LMEDS = 4, //!< least-median algorithm
235 FM_RANSAC = 8 //!< RANSAC algorithm
296 using this subset and a simple least-square algorithm, and then compute the quality/goodness of th
    [all...]
  /external/opencv3/modules/java/src/
core.cpp     [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/
wincrypt.h     [all...]
  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.Tools.pas 780 // Knuth covers it well enough in Vol III. 6.4.; but beware, Algorithm R
  /external/lzma/CS/7zip/Compress/LZMA/
LzmaEncoder.cs     [all...]
  /external/v8/benchmarks/
deltablue.js 33 * algorithm, as described in:
35 * "The DeltaBlue Algorithm: An Incremental Constraint Hierarchy Solver"
578 * on its output. The algorithm attempts to resatisfy that
585 * the algorithm to avoid getting into an infinite loop even if the
  /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/machinelearning/
layer1.py     [all...]

Completed in 1688 milliseconds

1 23 4