- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for 2n (0.02 sec)
-
src/crypto/x509/verify_test.go
rLUk9TiRodZL2vG70t5HtfG8gfZZa88ZU+mNFctKy6lvROUbQc/hhqfK0GqfvEyN BjNaooXlkDWgYlwWTvDjovoDGrQscbNYLN57C9saD+veIR8GdwYDsMnvmfzAuU8L hij+0rnq49qlw0dpEuDb8PYZi+17cNcC1u2HGCgsBCRMd+RIihrGO5rUD8r6ddIB QFqNeb+Lz0vPqhbBleStTIo+F5HUsWLlguWABKQDfo2/2n+iD5dPDNMN+9fR5XJ+ HMh3/1uaD7euBUbl8agW7EekFwIDAQABo4H2MIHzMIGwBgNVHREEgagwgaWBD2lu Zm9AaXplbnBlLmNvbaSBkTCBjjFHMEUGA1UECgw+SVpFTlBFIFMuQS4gLSBDSUYg QTAxMzM3MjYwLVJNZXJjLlZpdG9yaWEtR2FzdGVpeiBUMTA1NSBGNjIgUzgxQzBB
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 110.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/ir/tfl_ops.cc
//===----------------------------------------------------------------------===// int64_t L2NormalizationOp::GetArithmeticCount(Operation* op) { int64_t count; // Computing the squared L2 norm is N multiply-adds so 2N ops, // then the single inverse-sqrt is negligible, then we multiply each // value by the resulting multiplier, so an extra N ops. count 3N ops. if (ArithmeticCountUtilHelper::GetFirstOutputCount(op, &count)) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu May 02 09:41:17 UTC 2024 - 169.2K bytes - Viewed (0)