Home
last modified time | relevance | path

Searched refs:x_i (Results 1 – 10 of 10) sorted by relevance

/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/raw/
DNat192.java265 int x_i = x[i] ^ Integer.MIN_VALUE; in gte() local
267 if (x_i < y_i) in gte()
269 if (x_i > y_i) in gte()
279 int x_i = x[xOff + i] ^ Integer.MIN_VALUE; in gte() local
281 if (x_i < y_i) in gte()
283 if (x_i > y_i) in gte()
379 long c = 0, x_i = x[i] & M; in mul() local
380 c += x_i * y_0 + (zz[i + 0] & M); in mul()
383 c += x_i * y_1 + (zz[i + 1] & M); in mul()
386 c += x_i * y_2 + (zz[i + 2] & M); in mul()
[all …]
DNat256.java360 int x_i = x[i] ^ Integer.MIN_VALUE; in gte() local
362 if (x_i < y_i) in gte()
364 if (x_i > y_i) in gte()
374 int x_i = x[xOff + i] ^ Integer.MIN_VALUE; in gte() local
376 if (x_i < y_i) in gte()
378 if (x_i > y_i) in gte()
482 long c = 0, x_i = x[i] & M; in mul() local
483 c += x_i * y_0 + (zz[i + 0] & M); in mul()
486 c += x_i * y_1 + (zz[i + 1] & M); in mul()
489 c += x_i * y_2 + (zz[i + 2] & M); in mul()
[all …]
DNat224.java290 int x_i = x[i] ^ Integer.MIN_VALUE; in gte() local
292 if (x_i < y_i) in gte()
294 if (x_i > y_i) in gte()
304 int x_i = x[xOff + i] ^ Integer.MIN_VALUE; in gte() local
306 if (x_i < y_i) in gte()
308 if (x_i > y_i) in gte()
380 long c = 0, x_i = x[i] & M; in mul() local
381 c += x_i * y_0 + (zz[i + 0] & M); in mul()
384 c += x_i * y_1 + (zz[i + 1] & M); in mul()
387 c += x_i * y_2 + (zz[i + 2] & M); in mul()
[all …]
DNat.java327 int x_i = x[i] ^ Integer.MIN_VALUE; in gte() local
329 if (x_i < y_i) in gte()
331 if (x_i > y_i) in gte()
1062 int x_i = x[i]; in toBigInteger() local
1063 if (x_i != 0) in toBigInteger()
1065 Pack.intToBigEndian(x_i, bs, (len - 1 - i) << 2); in toBigInteger()
/external/ceres-solver/internal/ceres/
Ddogleg_strategy.cc495 const Vector2d x_i = ComputeSubspaceStepFromRoot(roots_real(i)); in FindMinimumOnTrustRegionBoundary() local
501 if (x_i.norm() > 0) { in FindMinimumOnTrustRegionBoundary()
502 const double f_i = EvaluateSubspaceModel((radius_ / x_i.norm()) * x_i); in FindMinimumOnTrustRegionBoundary()
506 *minimum = x_i; in FindMinimumOnTrustRegionBoundary()
/external/opencv3/doc/py_tutorials/py_video/py_lucas_kanade/
Dpy_lucas_kanade.markdown67 \sum_{i}{f_{x_i}}^2 & \sum_{i}{f_{x_i} f_{y_i} } \\
68 \sum_{i}{f_{x_i} f_{y_i}} & \sum_{i}{f_{y_i}}^2
71 - \sum_{i}{f_{x_i} f_{t_i}} \\
/external/opencv3/modules/ml/doc/
Dml_intro.markdown192 The boosted model is based on \f$N\f$ training examples \f${(x_i,y_i)}1N\f$ with \f$x_i \in{R^K}\f$
193 and \f$y_i \in{-1, +1}\f$ . \f$x_i\f$ is a \f$K\f$ -component vector. Each component encodes a
208 - Set \f$N\f$ examples \f${(x_i,y_i)}1N\f$ with \f$x_i \in{R^K}, y_i \in{-1, +1}\f$ .
218 - Set \f$w_i \Leftarrow w_i exp[c_m 1_{(y_i \neq f_m(x_i))}], i = 1,2,...,N,\f$ and
314 number of mixtures \f$M\f$ and the samples \f$x_i\f$, \f$i=1..N\f$ the algorithm finds the maximum-
332 …its_{i=1}^{N}\alpha_{ki}x_i}{\sum\limits_{i=1}^{N}\alpha_{ki}} , \quad S_k= \frac{\sum\limits_{i=…
/external/opencv3/doc/py_tutorials/py_feature2d/py_orb/
Dpy_orb.markdown32 any feature set of \f$n\f$ binary tests at location \f$(x_i, y_i)\f$, define a \f$2 \times n\f$ mat…
/external/opencv3/doc/tutorials/ml/introduction_to_pca/
Dintroduction_to_pca.markdown37 … are arranged as a set of _n_ data vectors \f$ x_1...x_n \f$ with each \f$ x_i \f$ representing a…
/external/ceres-solver/docs/source/
Dsolving.rst274 Given a set of pairs :math:`\{(x_i, y_i)\}`, the user wishes to estimate