Searched refs:optimal (Results 1 – 25 of 108) sorted by relevance
12345
| /external/opencv3/doc/tutorials/ml/introduction_to_svm/ |
| D | introduction_to_svm.markdown | 17 outputs an optimal hyperplane which categorizes new examples.
19 In which sense is the hyperplane obtained optimal? Let's consider the following simple problem:
40 **margin** within SVM's theory. Therefore, the optimal separating hyperplane *maximizes* the margin
43 
45 How is the optimal hyperplane computed?
58 The optimal hyperplane can be represented in an infinite number of different ways by
92 the weight vector \f$\beta\f$ and the bias \f$\beta_{0}\f$ of the optimal hyperplane.
144 less number of steps even if the optimal hyperplane has not been computed yet. This
178 optimal separating hyperplane.
|
| /external/llvm/test/CodeGen/PowerPC/ |
| D | constants.ll | 1 ; All of these routines should be perform optimal load of constants.
|
| D | machine-combiner.ll | 65 ; Verify that we reassociate some of these ops. The optimal balanced tree of adds is not
|
| /external/llvm/docs/HistoricalNotes/ |
| D | 2001-04-16-DynamicCompilation.txt | 18 there are two reasons that optimal system performance may be obtained by a
23 optimal performance in all cases, because applications have varying dynamic
|
| /external/autotest/ |
| D | PRESUBMIT.cfg | 15 # computing optimal -r options based on PRESUBMIT_FILES.
|
| /external/glide/third_party/gif_encoder/ |
| D | LICENSE | 14 "Kohonen neural networks for optimal colour quantization" in "Network:
|
| /external/llvm/test/CodeGen/SPARC/ |
| D | float-constants.ll | 3 ; TODO: actually fix the codegen to be optimal. At least we don't
|
| /external/opencv3/doc/tutorials/core/discrete_fourier_transform/ |
| D | discrete_fourier_transform.markdown | 52 -# **Expand the image to an optimal size**. The performance of a DFT is dependent of the image
56 optimal size and we can use the @ref cv::copyMakeBorder() function to expand the borders of an
59 Mat padded; //expand input image to optimal size
|
| /external/llvm/test/CodeGen/X86/ |
| D | buildvec-insertvec.ll | 23 ; TODO: the codegen for function 'test_negative_zero_1' is sub-optimal.
|
| D | swizzle-avx2.ll | 8 ; illegal shuffle that is expanded into a sub-optimal sequence of instructions
|
| /external/llvm/docs/ |
| D | Packaging.rst | 12 break things for constrained platforms. These settings are not optimal for most
|
| /external/llvm/test/MC/MachO/ |
| D | x86_32-optimal_nop.s | 153 # Only the .text sections gets optimal nops.
|
| /external/autotest/client/profilers/powertop/src/ |
| D | README | 13 as a result the behavior is sometimes far from optimal, and a lot of
|
| /external/v8/src/compiler/ |
| D | greedy-allocator.cc | 610 LifetimePosition optimal = FindOptimalSplitPos(previous, pos->pos()); in GetLastResortSplitPosition() local
612 GetSplitPositionForInstruction(range, optimal.ToInstructionIndex()); in GetLastResortSplitPosition()
|
| /external/libvorbis/doc/ |
| D | Vorbis_I_spec.tex | 45 % left to the typesetting engine to place them in the "optimal" spot. These
|
| /external/llvm/test/CodeGen/AMDGPU/ |
| D | store.ll | 36 ; XXX: An optimal scheduler should merge this into one of the prevous IGs.
69 ; XXX: An optimal scheduler should merge this into one of the prevous IGs.
|
| /external/mesa3d/src/egl/docs/ |
| D | EGL_MESA_screen_surface | 141 that looks best but other sub-optimal resolutions may be supported.
340 EGL_OPTIMAL_MESA Set if the most is especially optimal for the
377 EGL_OPTIMAL_MESA 1 indicates an optimal mode, 0 otherwise
|
| /external/glide/ |
| D | LICENSE | 83 "Kohonen neural networks for optimal colour quantization" in "Network:
|
| /external/llvm/test/CodeGen/ARM/ |
| D | returned-ext.ll | 111 ; Since there doesn't seem to be an unambiguous optimal selection and
|
| /external/mesa3d/src/gallium/state_trackers/d3d1x/docs/ |
| D | coding_style.txt | 69 To iterate, use the following idiom from LLVM, which is optimal, unless end() is trivial:
|
| /external/lz4/ |
| D | lz4_block_format.txt | 115 or full optimal parsing.
|
| /external/opencv3/doc/py_tutorials/py_imgproc/py_transforms/py_fourier_transform/ |
| D | py_fourier_transform.markdown | 179 the array to any optimal size (by padding zeros) before finding DFT. For OpenCV, you have to
183 So how do we find this optimal size ? OpenCV provides a function, **cv2.getOptimalDFTSize()** for
|
| /external/webrtc/talk/app/webrtc/objctests/ |
| D | RTCPeerConnectionSyncObserver.m | 145 // polling is not optimal.
|
| /external/opencv3/doc/tutorials/imgproc/imgtrans/canny_detector/ |
| D | canny_detector.markdown | 15 *optimal detector*, Canny algorithm aims to satisfy three main criteria:
|
| /external/opencv3/doc/py_tutorials/py_feature2d/py_features_harris/ |
| D | py_features_harris.markdown | 90 # Threshold for an optimal value, it may vary depending on the image.
|
12345