OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:approximation
(Results
226 - 250
of
800
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/packages/services/Telephony/src/com/android/phone/common/mail/internet/
MimeBodyPart.java
29
* TODO this is a close
approximation
of Message, need to update along with
/prebuilts/gdb/darwin-x86/lib/python2.7/
fractions.py
218
#
approximation
* to x to be a rational number p/q such that:
223
# Define *best lower
approximation
* similarly. Then it can be
225
#
approximation
to x if, and only if, it is a convergent or
229
# To find a best rational
approximation
with denominator <= M,
/prebuilts/gdb/linux-x86/lib/python2.7/
fractions.py
218
#
approximation
* to x to be a rational number p/q such that:
223
# Define *best lower
approximation
* similarly. Then it can be
225
#
approximation
to x if, and only if, it is a convergent or
229
# To find a best rational
approximation
with denominator <= M,
/prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/big/
rat_test.go
492
// always picks the closest float32
approximation
.
540
// always picks the closest float64
approximation
.
639
//
approximation
of r.
676
//
approximation
of r.
/prebuilts/go/darwin-x86/src/cmd/compile/internal/big/
rat_test.go
489
// always picks the closest float32
approximation
.
537
// always picks the closest float64
approximation
.
636
//
approximation
of r.
673
//
approximation
of r.
/prebuilts/go/darwin-x86/src/image/jpeg/
scan.go
111
// ah and al are the successive
approximation
high and low values.
119
// order. Successive
approximation
is when not all of the bits of a
139
return FormatError("bad successive
approximation
values")
368
// refine decodes a successive
approximation
refinement block, as specified in
/prebuilts/go/darwin-x86/src/math/big/
rat_test.go
489
// always picks the closest float32
approximation
.
537
// always picks the closest float64
approximation
.
636
//
approximation
of r.
673
//
approximation
of r.
/prebuilts/go/darwin-x86/src/strconv/
extfloat.go
260
// best
approximation
of d after being rounded to a float64 or
304
// Now f is a good
approximation
of the decimal.
309
// In many cases the
approximation
will be good enough.
647
//
Approximation
is too wide.
/prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/big/
rat_test.go
492
// always picks the closest float32
approximation
.
540
// always picks the closest float64
approximation
.
639
//
approximation
of r.
676
//
approximation
of r.
/prebuilts/go/linux-x86/src/cmd/compile/internal/big/
rat_test.go
489
// always picks the closest float32
approximation
.
537
// always picks the closest float64
approximation
.
636
//
approximation
of r.
673
//
approximation
of r.
/prebuilts/go/linux-x86/src/image/jpeg/
scan.go
111
// ah and al are the successive
approximation
high and low values.
119
// order. Successive
approximation
is when not all of the bits of a
139
return FormatError("bad successive
approximation
values")
368
// refine decodes a successive
approximation
refinement block, as specified in
/prebuilts/go/linux-x86/src/math/big/
rat_test.go
489
// always picks the closest float32
approximation
.
537
// always picks the closest float64
approximation
.
636
//
approximation
of r.
673
//
approximation
of r.
/prebuilts/go/linux-x86/src/strconv/
extfloat.go
260
// best
approximation
of d after being rounded to a float64 or
304
// Now f is a good
approximation
of the decimal.
309
// In many cases the
approximation
will be good enough.
647
//
Approximation
is too wide.
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
fractions.py
218
#
approximation
* to x to be a rational number p/q such that:
223
# Define *best lower
approximation
* similarly. Then it can be
225
#
approximation
to x if, and only if, it is a convergent or
229
# To find a best rational
approximation
with denominator <= M,
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/
fractions.py
218
#
approximation
* to x to be a rational number p/q such that:
223
# Define *best lower
approximation
* similarly. Then it can be
225
#
approximation
to x if, and only if, it is a convergent or
229
# To find a best rational
approximation
with denominator <= M,
/system/extras/tests/sdcard/
testcase.h
49
//
approximation
of how much longer the read tasks must run to
/packages/apps/ExactCalculator/src/com/android/calculator2/
Evaluator.java
67
* We cache the best decimal
approximation
we have already computed. We compute generously to
69
* from "0000" to "9999". The best known result
approximation
is maintained as a string by
465
throw new AssertionError("New
approximation
invalidates old one!");
572
* @param cache Current
approximation
as string.
622
* @param cache String
approximation
of value. Assumed to be long enough
[
all
...]
/external/ceres-solver/docs/source/
solving.rst
44
[NocedalWright]_. At each iteration, the
approximation
is solved to
46
non-linear least squares, an
approximation
can be constructed by using
232
approximation
if we restrict ourselves to moving along the direction
253
Levenberg-Marquardt solves the linear
approximation
from scratch with
378
Here :math:`H(x)` is some
approximation
to the Hessian of the
406
dimensions in which a full, dense
approximation
to the inverse
411
4. ``LBFGS`` A limited memory
approximation
to the full ``BFGS``
[
all
...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/
LaguerreSolver.java
36
*
approximation
and be able to solve all roots from that point.</p>
410
// now pv != 0, calculate the new
approximation
/external/chromium-trace/catapult/third_party/Paste/docs/
url-parsing-with-wsgi.txt
249
segments. But we'll implement a rough
approximation
of `Quixote's
279
request, but this is only a rough
approximation
of the framework.
/external/deqp/framework/common/
tcuFloatFormat.cpp
91
* value, not the
approximation
. This is because otherwise a less accurate
92
*
approximation
could be closer in ULPs, because its ULPs are bigger.
/external/eigen/Eigen/src/Core/arch/NEON/
PacketMath.h
137
// NEON does not offer a divide instruction, we have to do a reciprocal
approximation
145
//
approximation
of 1/b.
/external/guava/guava/src/com/google/common/primitives/
UnsignedLongs.java
197
* Otherwise, approximate the quotient, check, and correct if necessary. Our
approximation
is
231
* Otherwise, approximate the quotient, check, and correct if necessary. Our
approximation
is
/external/libvpx/libvpx/vp9/encoder/
vp9_speed_features.h
235
// Coefficient probability model
approximation
step size
420
// Fast
approximation
of vp9_model_rd_from_var_lapndz
/external/opencv3/modules/imgproc/include/opencv2/imgproc/
types_c.h
453
/** Contour
approximation
methods */
488
/** Contour
approximation
algorithms */
Completed in 788 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>