- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 132 for Multiplier (0.15 sec)
-
src/vendor/golang.org/x/crypto/internal/poly1305/sum_s390x.s
// coefficients for first iteration // // So in this case we would have two iterations. In the first // both lanes are multiplied by r². In the second only the // first lane is multiplied by r² and the second lane is // instead multiplied by r. This gives use the odd and even // powers of r that we need from the original equation. // // Notation: // // h - accumulator // r - key
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 17.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/ir/tfl_ops.cc
const int64_t outer_size = std::accumulate( outer_dims.begin(), outer_dims.end(), 1, std::multiplies<int64_t>()); const auto base_inner_dims = output_type.getShape().drop_front(axis + 1); const int64_t base_inner_size = std::accumulate(base_inner_dims.begin(), base_inner_dims.end(), 1, std::multiplies<int64_t>()); // Splits each input operand into outer_size pieces and combines them in
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu May 02 09:41:17 UTC 2024 - 169.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/quantization/device_target.cc
double scale_product = in_spec.getScale() * w_spec.getScale(); if (fabs(scale_product - b_spec.getScale()) >= 1e-6) return failure(); // input multipliers input_multipliers->append(3, kUnitQuantizedMultiplier); // output multipliers double real_multiplier = scale_product / o_spec.getScale(); output_multipliers->push_back(QuantizeMultiplier(real_multiplier)); // output ranges
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Mar 08 10:41:08 UTC 2024 - 7.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/tests/optimize.mlir
func.return %1 : tensor<2x1024xf32> // CHECK-DAG: %[[MULTIPLIER:.*]] = arith.constant dense<2.000000e+00> : tensor<2x512xf32> // CHECK-DAG: %[[WEIGHTS:.*]] = arith.constant dense<3.000000e+00> : tensor<1024x512xf32> // CHECK-DAG: %[[BIAS:.*]] = arith.constant dense<5.000000e+00> : tensor<1024xf32> // CHECK: %[[VAL_0:.*]] = tfl.mul %arg0, %[[MULTIPLIER]] {fused_activation_function = "NONE"} : tensor<2x512xf32>
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu May 16 20:31:41 UTC 2024 - 284.1K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/api/resource/math.go
if a == 0 || a == 1 { return a * b, true } if a == mostNegative && b != 1 { return 0, false } c := a * b return c, c/b == a } // int64MultiplyScale10 multiplies a by 10, or returns false if that would overflow. This method is faster than // int64Multiply(a, 10) because the compiler can optimize constant factor multiplication. func int64MultiplyScale10(a int64) (int64, bool) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jan 23 13:07:14 UTC 2020 - 7.3K bytes - Viewed (0) -
src/cmd/internal/obj/x86/ytab.go
} // Returns true if yt is compatible with args. // // Elements from args and yt.args are used // to index ycover table like `ycover[args[i]+yt.args[i]]`. // This means that args should contain values that already // multiplied by Ymax. func (yt *ytab) match(args []int) bool { // Trailing Yxxx check is required to avoid a case // where shorter arg list is matched. // If we had exact yt.args length, it could be `yt.argc != len(args)`.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Oct 06 15:40:03 UTC 2018 - 1.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/quantization/device_target.h
}; // Maps the signature to the kernel spec. Note that the matching is // pattern match based. llvm::DenseMap<Signature, KernelSpec, SignatureInfo> all_signatures_; // A method to compute the effective multipliers. This is independent on the // bits of the ports, thus all the signature shares the same here. ScaleDecomposeFn decompose_fn_; }; class DeviceTarget { public: explicit DeviceTarget(MLIRContext* ctx);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Mar 08 10:41:08 UTC 2024 - 7.1K bytes - Viewed (0) -
hack/serve-prom-scrapes.sh
# <timestamp>.scrape # where <timestamp> is seconds since Jan 1, 1970 UTC. # Each such file is taken to be a scrape that lacks timestamps, # and the timestamp from the filename is multiplied by the necessary 1000 # and added to the data in that file. # This requires an `nc` command that this script knows how to wrangle. if (( $# != 2 )); then echo "Usage: $0 port_num scrapes_dir" >&2 exit 1
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Feb 04 06:33:06 UTC 2022 - 1.9K bytes - Viewed (0) -
pkg/apis/authentication/types.go
// It can be repeated multiplied times for multiple groups. ImpersonateGroupHeader = "Impersonate-Group" // ImpersonateUserExtraHeaderPrefix is a prefix for any header used to impersonate an entry in the // extra map[string][]string for user.Info. The key will be every after the prefix. // It can be repeated multiplied times for multiple map keys and the same key can be repeated multiple
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Mar 10 05:33:37 UTC 2023 - 7.2K bytes - Viewed (0) -
src/hash/crc32/crc32_s390x.s
// intermediate results with a single VECTOR GALOIS FIELD MULTIPLY instruction. // The rightmost doubleword can be 0 to prevent contribution to the result or // can be multiplied by 1 to perform an XOR without the need for a separate // VECTOR EXCLUSIVE OR instruction. // // The polynomials used are bit-reflected: // // IEEE: P'(x) = 0x0edb88320 // Castagnoli: P'(x) = 0x082f63b78
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 20 00:49:17 UTC 2021 - 7.6K bytes - Viewed (0)