- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 130 for multiplication (0.18 sec)
-
src/math/gamma.go
3.47222221605458667310e-03, 8.33333333333482257126e-02, } // Gamma function computed by Stirling's formula. // The pair of results must be multiplied together to get the actual answer. // The multiplication is left to the caller so that, if careful, the caller can avoid // infinity for 172 <= x <= 180. // The polynomial is valid for 33 <= x <= 172; larger values are only used
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 5.5K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/api/resource/amount_test.go
t.Errorf("unexpeted failure: %v", c) } else if ok { if c != test.c { t.Errorf("%v: unexpected result: %d", test, c) } } else { if c != test.a { t.Errorf("%v: overflow multiplication mutated source: %d", test, c) } } } } func TestInt64AsCanonicalString(t *testing.T) { for _, test := range []struct { value int64 scale Scale result string
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Oct 13 20:54:15 UTC 2023 - 7K bytes - Viewed (0) -
tensorflow/cc/gradients/linalg_grad.cc
// Furthermore, recall that matrix multiplication, which is // represented by the equation "ab,bc->ac", has its VJPs given by the // einsum equations "ac,bc->ab" and "ab,ac->bc" (see, for example // https://math.stackexchange.com/a/2755680). Combined with transposes and // traces we can rewrite Tensor contractions as regular matrix // multiplication. Since each of these operations have their VJPs described
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Mar 07 23:11:54 UTC 2022 - 20.4K bytes - Viewed (0) -
src/crypto/ecdh/ecdh.go
curve Curve privateKey []byte boring *boring.PrivateKeyECDH // publicKey is set under publicKeyOnce, to allow loading private keys with // NewPrivateKey without having to perform a scalar multiplication. publicKey *PublicKey publicKeyOnce sync.Once } // ECDH performs an ECDH exchange and returns the shared secret. The [PrivateKey] // and [PublicKey] must use the same curve. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 13 17:09:47 UTC 2023 - 6.4K bytes - Viewed (0) -
src/hash/crc32/crc32_s390x.s
VLM 0(R3), V5, V8 VPERM V5, V5, CONST_PERM_LE2BE, V5 VPERM V6, V6, CONST_PERM_LE2BE, V6 VPERM V7, V7, CONST_PERM_LE2BE, V7 VPERM V8, V8, CONST_PERM_LE2BE, V8 // Perform a GF(2) multiplication of the doublewords in V1 with // the reduction constants in V0. The intermediate result is // then folded (accumulated) with the next data chunk in V5 and // stored in V1. Repeat this step for the register contents
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 20 00:49:17 UTC 2021 - 7.6K bytes - Viewed (0) -
src/strconv/ftoaryu.go
// // See Ulf Adams, "Ryƫ: Fast Float-to-String Conversion" (doi:10.1145/3192366.3192369) // // Fixed precision formatting is a variant of the original paper's // algorithm, where a single multiplication by 10^k is required, // sharing the same rounding guarantees. // ryuFtoaFixed32 formats mant*(2^exp) with prec decimal digits. func ryuFtoaFixed32(d *decimalSlice, mant uint32, exp int, prec int) { if prec < 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 09 00:28:56 UTC 2022 - 15.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/prepare_quantize_helper.h
// [-512, 512], instead of [-32767, 32767]. // For now this behavior is specific for SVDF, where 6 bits are reserved for // the reduce operation after element-wise multiplication between state and // time weights. if (tensor_property.number_of_bits == 10) { SmallVector<double, 4> mins(1, std::numeric_limits<double>::max());
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 03 18:01:23 UTC 2024 - 28K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
return true; } }, /** * This strategy uses all 128 bits of {@link Hashing#murmur3_128} when hashing. It looks different * from the implementation in MURMUR128_MITZ_32 because we're avoiding the multiplication in the * loop and doing a (much simpler) += hash2. We're also changing the index to a positive number by * AND'ing with Long.MAX_VALUE instead of flipping the bits. */ MURMUR128_MITZ_64() { @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 10.7K bytes - Viewed (0) -
src/crypto/ecdh/nist.go
// invalid scalars and the zero value. BytesX returns an error for the point // at infinity, but in a prime order group such as the NIST curves that can // only be the result of a scalar multiplication if one of the inputs is the // zero scalar or the point at infinity. if boring.Enabled { return boring.ECDH(local.boring, remote.boring) } boring.Unreachable()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 8.1K bytes - Viewed (0) -
src/math/expm1.go
// From step 1, we have // expm1(x) = either 2**k*[expm1(r)+1] - 1 // = or 2**k*[expm1(r) + (1-2**-k)] // 4. Implementation notes: // (A). To save one multiplication, we scale the coefficient Qi // to Qi*2**i, and replace z by (x**2)/2. // (B). To achieve maximum accuracy, we compute expm1(x) by // (i) if x < -56*ln2, return -1.0, (raise inexact if x!=inf)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 7.9K bytes - Viewed (0)