| /external/ceres-solver/examples/ |
| D | denoising.cc | 90 PGMImage<double>* solution) { in CreateProblem() argument
100 solution->MutablePixelFromLinearIndex(index)); in CreateProblem()
120 double* pixel = solution->MutablePixel(x + x_delta_indices[i], in CreateProblem()
137 void SolveProblem(Problem* problem, PGMImage<double>* solution) { in SolveProblem() argument
157 for (int x = 0; x < solution->width(); ++x) { in SolveProblem()
158 for (int y = 0; y < solution->height(); ++y) { in SolveProblem()
159 *solution->MutablePixel(x, y) = in SolveProblem()
160 std::min(255.0, std::max(0.0, solution->Pixel(x, y))); in SolveProblem()
200 PGMImage<double> solution(image.width(), image.height()); in main() local
201 solution.Set(0.0); in main()
[all …]
|
| /external/ceres-solver/internal/ceres/ |
| D | schur_complement_solver.cc | 126 bool DenseSchurComplementSolver::SolveReducedLinearSystem(double* solution) { in SolveReducedLinearSystem() argument
139 VectorRef(solution, num_rows) = in SolveReducedLinearSystem()
248 bool SparseSchurComplementSolver::SolveReducedLinearSystem(double* solution) { in SolveReducedLinearSystem() argument
251 return SolveReducedLinearSystemUsingSuiteSparse(solution); in SolveReducedLinearSystem()
253 return SolveReducedLinearSystemUsingCXSparse(solution); in SolveReducedLinearSystem()
269 double* solution) { in SolveReducedLinearSystemUsingSuiteSparse() argument
325 VectorRef(solution, num_rows) in SolveReducedLinearSystemUsingSuiteSparse()
339 double* solution) { in SolveReducedLinearSystemUsingSuiteSparse() argument
350 double* solution) { in SolveReducedLinearSystemUsingCXSparse() argument
365 VectorRef(solution, num_rows) = ConstVectorRef(rhs(), num_rows); in SolveReducedLinearSystemUsingCXSparse()
[all …]
|
| D | schur_complement_solver.h | 128 virtual bool SolveReducedLinearSystem(double* solution) = 0;
148 virtual bool SolveReducedLinearSystem(double* solution);
162 virtual bool SolveReducedLinearSystem(double* solution);
163 bool SolveReducedLinearSystemUsingSuiteSparse(double* solution);
164 bool SolveReducedLinearSystemUsingCXSparse(double* solution);
|
| D | implicit_schur_complement_test.cc | 74 Vector* solution) { in ReducedLinearSystemAndSolution() argument
108 solution->resize(num_cols_); in ReducedLinearSystemAndSolution()
109 solution->setZero(); in ReducedLinearSystemAndSolution()
110 VectorRef schur_solution(solution->data() + num_cols_ - num_schur_rows, in ReducedLinearSystemAndSolution()
114 schur_solution.data(), solution->data()); in ReducedLinearSystemAndSolution()
|
| D | visibility_based_preconditioner.cc | 472 cholmod_dense* solution = CHECK_NOTNULL(ss->Solve(factor_, tmp_rhs_)); in RightMultiply() local
473 memcpy(y, solution->x, sizeof(*y) * num_rows); in RightMultiply()
474 ss->Free(solution); in RightMultiply()
|
| D | matrix.proto | 125 // The desired solution for the problem is the vector x that solves the
130 // If x is present, then it is the expected solution to the
|
| /external/eigen/doc/ |
| D | D03_WrongStackAlignment.dox | 25 \section sec_sol1 Local solution
27 A local solution is to mark such a function with this attribute:
35 …a macro which you leave empty on other platforms. The advantage of this solution is that you can f…
40 A global solution is to edit your project so that when compiling with GCC on Windows, you pass this…
46 Another global solution is to pass this option to gcc:
|
| D | C06_TutorialLinearAlgebra.dox | 27 …nd \a b are matrices (\a b could be a vector, as a special case). You want to find a solution \a x.
29 \b The \b solution: You can choose between various decompositions, depending on what your matrix \a…
128 \section TutorialLinAlgSolutionExists Checking if a solution really exists
130 Only you know what error margin you want to allow for a solution to be considered valid.
|
| /external/v8/tools/visual_studio/ |
| D | README.txt | 2 Studio/Visual C++ Express solution has been retired. If a Visual
3 Studio project/solution is needed there is the option of using GYP to
|
| /external/llvm/docs/HistoricalNotes/ |
| D | 2001-04-16-DynamicCompilation.txt | 7 providing a solution to these two goals will yield an excellent solution
30 On a social level, static compilation is a very shortsighted solution to
44 solution to these problems. Its design allows the large body of platform
|
| /external/chromium/googleurl/build/ |
| D | README.txt | 1 This directory includes solution and project files for compiling with
|
| /external/stlport/doc/ |
| D | pointer_specialization.txt | 59 On a second thought a possible solution is to limit the partial
86 There is of course a solution for this specialization issue. We
90 No doubt that a solution to this problem will be soon found.
|
| D | stlport_namespaces.txt | 73 This solution has a first major drawback which is that STLport would be much more sensible
77 Moreover this solution just does not work for a very simple reason. The C++ Standard
|
| /external/ceres-solver/docs/ |
| D | ceres-solver.bib | 37 …title={Approximate solution of the trust region problem by minimization over two-dimensional subsp…
133 …Title = {{Domain decomposition methods for the numerical solution of partial differential equation…
177 …title = {A solution to the general problem of multiple station analytical stereo triangulat…
238 Title = {{A method for the solution of certain nonlinear problems in least squares}},
|
| D | powell.tex | 62 and \texttt{F4}. Then let us consider the construction and solution of the problem. For brevity we…
100 …timal solution to this problem is at $x_1=0, x_2=0, x_3=0, x_4=0$ with an objective function value…
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 148 const PBQP::Solution &solution);
469 const PBQP::Solution &solution) { in mapPBQPToRegAlloc() argument
483 unsigned alloc = solution.getSelection(node); in mapPBQPToRegAlloc()
603 PBQP::Solution solution = in runOnMachineFunction() local
607 pbqpAllocComplete = mapPBQPToRegAlloc(*problem, solution); in runOnMachineFunction()
|
| /external/v8/build/ |
| D | README.txt | 47 To generate Visual Studio solution and project files on Windows:
62 Now generate Visual Studio solution and project files for the ia32 architecture:
|
| /external/libvpx/libvpx/third_party/libyuv/ |
| D | README.webm | 17 system. This is a temporal solution, and will be improved later.
|
| /external/valgrind/main/docs/internals/ |
| D | arm_thumb_notes_gdbserver.txt | 77 * use the debug info : this solution was discarded as often debug
78 info does not allow a 100% correct solution. debug info is acceptable
87 * the final solution implemented was to add a Delta fied in IstMark.
|
| /external/opencv/cvaux/src/ |
| D | cvlmeds.cpp | 678 double solution[9]; in icvAnalyticPoints8() local
787 solution[a] = 0; in icvAnalyticPoints8()
791 solution[a] += temp2[a_num + t] * f[t]; in icvAnalyticPoints8()
801 solution[a] = solution[a - 1]; in icvAnalyticPoints8()
804 solution[a] = 1; in icvAnalyticPoints8()
816 summ += A[a9 + t] * solution[t]; in icvAnalyticPoints8()
828 F[j] = solution[j]; in icvAnalyticPoints8()
|
| /external/icu4c/samples/translit/ |
| D | README.TXT | 7 The code currently provided in the solution file is the answer to the exercises, each step can stil…
83 more elegant algorithmic solution is available. Instead of typing
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ARM/ |
| D | 2012-06-15-lsr-noaddrmode.ll | 12 ;The chosen solution requires 4 regs, with addrec cost 1, plus 3 base adds, plus 2 setup cost:
25 ;The chosen solution requires 4 regs, with addrec cost 1, plus 1 base add, plus 2 setup cost:
|
| /external/llvm/test/CodeGen/ARM/ |
| D | 2011-08-29-SchedCycle.ll | 28 ; The right solution is to fix LegalizeType too chains the libcalls together.
|
| /external/llvm/test/CodeGen/Mips/ |
| D | addressing-mode.ll | 6 ; Check that LSR doesn't choose a solution with a formula "reg + 4*reg".
|
| /external/libvpx/libvpx/ |
| D | configure | 442 for tgt in libs examples docs solution; do
586 enable solution
|