/external/opencv3/modules/core/include/opencv2/core/ |
optim.hpp | 51 The algorithms in this section minimize or maximize function value within specified constraints or 85 *It should be called at least once before the call to* minimize(), as default value is not usable. 99 This method *is not necessary* to be called before the first call to minimize(), as the default 122 virtual double minimize(InputOutputArray x) = 0; 168 Step, together with initial point (givin in DownhillSolver::minimize) are two `n`-dimensional
|
/libcore/ojluni/src/main/java/sun/security/x509/ |
GeneralSubtrees.java | 185 * minimize this GeneralSubtrees by removing all redundant entries. 188 private void minimize() { method in class:GeneralSubtrees 336 // Step 2: For ease of checking the subtrees, minimize them by 339 this.minimize(); 340 other.minimize(); 483 // Minimize this 484 minimize(); method
|
/external/libgdx/extensions/gdx-setup/src/com/badlogic/gdx/setup/ |
GdxSetupUI.java | 313 JButton minimize; field in class:GdxSetupUI.UI 359 minimize = new JButton(minIcon); 368 minimize.setOpaque(false); 369 minimize.setContentAreaFilled(false); 370 minimize.setFocusPainted(false); 371 minimize.setBorderPainted(false); 372 minimize.setPressedIcon(minIconDown); 373 minimize.setRolloverIcon(minIconHover); 384 titleEvents(minimize, exit); 387 private void titleEvents(JButton minimize, JButton exit) [all...] |
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
LevenbergMarquardt.h | 131 LevenbergMarquardtSpace::Status minimize(FVectorType &x); 258 LevenbergMarquardt<FunctorType>::minimize(FVectorType &x) function in class:Eigen::LevenbergMarquardt 342 return minimize(x); 369 LevenbergMarquardtSpace::Status info = LevenbergMarquardtSpace::Status(lm.minimize(x));
|
/external/opencv3/modules/core/test/ |
test_conjugate_gradient.cpp | 48 double res=solver->minimize(x);
|
test_downhill_simplex.cpp | 56 double res=solver->minimize(x);
|
/external/eigen/unsupported/test/ |
NonLinearOptimization.cpp | 207 info = lm.minimize(x); 599 info = lm.minimize(x); 684 info = lm.minimize(x); 705 info = lm.minimize(x); 764 info = lm.minimize(x); 781 info = lm.minimize(x); 854 info = lm.minimize(x); 876 info = lm.minimize(x); 940 info = lm.minimize(x); 957 info = lm.minimize(x) [all...] |
levenberg_marquardt.cpp | 100 info = lm.minimize(x); 204 info = lm.minimize(x); 289 info = lm.minimize(x); 310 info = lm.minimize(x); 369 info = lm.minimize(x); 386 info = lm.minimize(x); 460 info = lm.minimize(x); 482 info = lm.minimize(x); 546 info = lm.minimize(x); 563 info = lm.minimize(x) [all...] |
/libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
TextImpl.java | 156 public final TextImpl minimize() { method in class:TextImpl
|
InnerNodeImpl.java | 163 ((TextImpl) node).minimize(); method
|
DOMConfigurationImpl.java | 403 text = text.minimize();
|
/external/opencv3/modules/core/src/ |
conjugate_gradient.cpp | 79 double minimize(InputOutputArray x); 123 double ConjGradSolverImpl::minimize(InputOutputArray x){ function in class:cv::ConjGradSolverImpl
|
downhill_simplex.cpp | 98 double res = MinProblemSolver->minimize(P); 178 double minimize( InputOutputArray x_ ) function in class:cv::DownhillSolverImpl 180 dprintf(("hi from minimize\n"));
|
/frameworks/base/tools/layoutlib/rename_font/ |
build_font_single.py | 190 keep the style info, to minimize the diff. """
|
build_font.py | 206 keep the style info, to minimize the diff. """
|
/external/v8/test/webkit/ |
dfg-get-by-val-clobber.js | 45 // Now the evil test. This is constructed to minimize the likelihood that CSE will succeed through
|
/external/pcre/dist/ |
pcre_exec.c | 526 BOOL minimize, possessive; /* Quantifier options */ local 751 minimize = possessive = FALSE; [all...] |
/external/eigen/test/ |
denseLM.cpp | 107 info = lm.minimize(uv);
|
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
LevenbergMarquardt.h | 78 LevenbergMarquardtSpace::Status minimize(FVectorType &x); 145 return minimize(x); 151 LevenbergMarquardt<FunctorType,Scalar>::minimize(FVectorType &x) function in class:Eigen::LevenbergMarquardt 640 LevenbergMarquardtSpace::Status info = LevenbergMarquardtSpace::Status(lm.minimize(x));
|
/external/chromium-trace/catapult/telemetry/telemetry/internal/browser/ |
browser_options.py | 123 'test is executed at maximum CPU speed in order to minimize noise '
|
/system/extras/ext4_utils/ |
allocate.c | 357 bool minimize = false; local 378 minimize = true; 379 } else if (!minimize) {
|
/external/ImageMagick/www/api/ |
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/libgdx/backends/gdx-backend-jglfw/src/com/badlogic/gdx/backends/jglfw/ |
JglfwGraphics.java | 439 public void minimize () { method in class:JglfwGraphics
|
/external/libunwind/doc/ |
libunwind.tex | 265 been designed for maximum efficiency, so as to minimize the
|
/external/chromium-trace/catapult/third_party/flot/ |
excanvas.js | 848 // Bounding box calculation (need to minimize displayed area so that [all...] |