/external/ceres-solver/examples/ |
H A D | denoising.cc | 92 PGMImage<double>* solution) { 102 solution->MutablePixelFromLinearIndex(index)); 122 double* pixel = solution->MutablePixel(x + x_delta_indices[i], 138 // solution stays within [0, 255]. 139 void SolveProblem(Problem* problem, PGMImage<double>* solution) { argument 162 // Make the solution stay in [0, 255]. 163 for (int x = 0; x < solution->width(); ++x) { 164 for (int y = 0; y < solution->height(); ++y) { 165 *solution->MutablePixel(x, y) = 166 std::min(255.0, std::max(0.0, solution 89 CreateProblem(const FieldsOfExperts& foe, const PGMImage<double>& image, Problem* problem, PGMImage<double>* solution) argument [all...] |
/external/ceres-solver/internal/ceres/ |
H A D | compressed_col_sparse_matrix_utils.h | 66 // R * solution = rhs 87 // R' * solution = rhs 122 double* solution) { 123 fill(solution, solution + num_cols, 0.0); 124 solution[rhs_nonzero_index] = 1.0 / values[cols[rhs_nonzero_index + 1] - 1]; 131 solution[c] -= v * solution[r]; 133 solution[c] = solution[ 117 SolveRTRWithSparseRHS(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, const int rhs_nonzero_index, double* solution) argument [all...] |
H A D | schur_complement_solver.h | 129 virtual bool SolveReducedLinearSystem(double* solution) = 0; 149 virtual bool SolveReducedLinearSystem(double* solution); 163 virtual bool SolveReducedLinearSystem(double* solution); 164 bool SolveReducedLinearSystemUsingSuiteSparse(double* solution); 165 bool SolveReducedLinearSystemUsingCXSparse(double* solution);
|
H A D | line_search.cc | 334 FunctionSample solution, bracket_low, bracket_high; local 403 &solution, 404 summary) && !solution.value_is_valid) { 414 solution = 415 solution.value_is_valid && solution.value <= bracket_low.value 416 ? solution : bracket_low; 418 summary->optimal_step_size = solution.x; 580 // Returns true iff solution satisfies the strong Wolfe conditions. Otherwise, 582 // reaching max_num_iterations, solution i 584 ZoomPhase(const FunctionSample& initial_position, FunctionSample bracket_low, FunctionSample bracket_high, FunctionSample* solution, Summary* summary) argument [all...] |
H A D | schur_complement_solver.cc | 120 bool DenseSchurComplementSolver::SolveReducedLinearSystem(double* solution) { argument 133 // the quality of the solution to the solve. 134 VectorRef(solution, num_rows) = 142 VectorRef(solution, num_rows) = ConstVectorRef(rhs(), num_rows); 145 solution); 245 bool SparseSchurComplementSolver::SolveReducedLinearSystem(double* solution) { argument 248 return SolveReducedLinearSystemUsingSuiteSparse(solution); 250 return SolveReducedLinearSystemUsingCXSparse(solution); 266 double* solution) { 321 VectorRef(solution, num_row 265 SolveReducedLinearSystemUsingSuiteSparse( double* solution) argument 327 SolveReducedLinearSystemUsingSuiteSparse( double* solution) argument 338 SolveReducedLinearSystemUsingCXSparse( double* solution) argument 369 SolveReducedLinearSystemUsingCXSparse( double* solution) argument [all...] |
H A D | implicit_schur_complement_test.cc | 74 Vector* solution) { 108 solution->resize(num_cols_); 109 solution->setZero(); 110 VectorRef schur_solution(solution->data() + num_cols_ - num_schur_rows, 114 schur_solution.data(), solution->data()); 157 // Reference solution to the f_block. 161 // Backsubstituted solution from the implicit schur solver using the 162 // reference solution to the f_block. 71 ReducedLinearSystemAndSolution(double* D, Matrix* lhs, Vector* rhs, Vector* solution) argument
|
H A D | compressed_row_sparse_matrix.cc | 271 double* solution) const { 274 solution[r] -= values_[idx] * solution[cols_[idx]]; 276 solution[r] /= values_[rows_[r + 1] - 1]; 281 double* solution) const { 283 solution[r] /= values_[rows_[r + 1] - 1]; 285 solution[cols_[idx]] -= values_[idx] * solution[r];
|
H A D | compressed_row_sparse_matrix.h | 122 void SolveLowerTriangularInPlace(double* solution) const; 123 void SolveLowerTriangularTransposeInPlace(double* solution) const;
|
H A D | covariance_impl.cc | 62 : solution(NULL), 71 ss.Free(solution); 78 cholmod_dense* solution; member in struct:ceres::internal::__anon1611::PerThreadContext 473 // is given by the solution to the linear system 497 cholmod_dense* solution = ss.Solve(factor, rhs); local 498 double* solution_x = reinterpret_cast<double*>(solution->x); 503 ss.Free(solution); 526 &context->solution, 559 &context->solution, 565 double* solution_x = reinterpret_cast<double*>(context->solution 728 double* solution = workspace.get() + thread_id * num_cols; local [all...] |
H A D | compressed_col_sparse_matrix_utils_test.cc | 264 double solution[4]; local 276 solution); 278 EXPECT_NEAR(solution[j], expected[4 * i + j], 1e-3) << i;
|
H A D | line_search.h | 85 // exact solution, the line search algorithm returns a solution 291 FunctionSample* solution,
|
H A D | visibility_based_preconditioner.cc | 440 cholmod_dense* solution = CHECK_NOTNULL(ss->Solve(factor_, tmp_rhs_)); local 441 memcpy(y, solution->x, sizeof(*y) * num_rows); 442 ss->Free(solution);
|
/external/chromium_org/chrome_frame/tools/ |
H A D | smoke_test.py | 69 to the builder's solution directory. 85 solution = win32com.client.GetObject(_CHROME_SOLUTION) 86 builder = solution.SolutionBuild
|
/external/chromium_org/tools/gyp/tools/ |
H A D | pretty_sln.py | 53 solution = open(solution_file) 54 for line in solution:
|
/external/llvm/lib/CodeGen/ |
H A D | RegAllocPBQP.cpp | 13 // solving this using a PBQP solver, and mapping the solution back to a 146 /// \brief Given a solved PBQP problem maps this solution back to a register 149 const PBQP::Solution &solution); 470 const PBQP::Solution &solution) { 478 // Iterate over the nodes mapping the PBQP solution to a register 484 unsigned alloc = solution.getSelection(node); 564 // * Map the solution back to a register allocation 604 PBQP::Solution solution = local 608 pbqpAllocComplete = mapPBQPToRegAlloc(*problem, solution); 469 mapPBQPToRegAlloc(const PBQPRAProblem &problem, const PBQP::Solution &solution) argument
|
/external/opencv/cvaux/src/ |
H A D | cvlmeds.cpp | 678 double solution[9]; local 747 { /* ----------- computing the solution ----------- */ 781 /* ----------- solution = V * W(-1) * U(T) * f ----------- */ 787 solution[a] = 0; 791 solution[a] += temp2[a_num + t] * f[t]; 801 solution[a] = solution[a - 1]; 804 solution[a] = 1; 816 summ += A[a9 + t] * solution[t]; 828 F[j] = solution[ [all...] |
/external/libvpx/libvpx/ |
H A D | configure | 487 for tgt in libs examples docs solution; do 660 enable_feature solution 672 all_targets="${all_targets} solution"
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/debug/ |
H A D | event-hub.rb | 10 information to only one listener, EventHubs provide a simple solution in
|
/external/libvpx/libvpx/build/make/ |
H A D | gen_msvs_sln.sh | 22 This script generates a Visual Studio 2005 solution file from a list of project
|
/external/chromium_org/third_party/mesa/src/docs/OLD/ |
H A D | MESA_program_debug.spec | 82 the GL. Isn't there another solution?
|
/external/mesa3d/docs/OLD/ |
H A D | MESA_program_debug.spec | 82 the GL. Isn't there another solution?
|
/external/libvpx/libvpx/examples/includes/geshi/geshi/ |
H A D | abap.php | 58 * ABAPREAD_DATASET.htm. If a technical solution is found, be careful : URLs
|
/external/ceres-solver/ |
H A D | Android.mk | 80 # which there is no solution. Hide the warning instead.
|
/external/ceres-solver/jni/ |
H A D | Android.mk | 111 # which there is no solution. Hide the warning instead.
|
/external/linux-tools-perf/config/ |
H A D | utilities.mak | 27 # The only solution is to change each newline into
|