- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 72 for SYMMETRIC (0.14 sec)
-
android/guava/src/com/google/common/base/Equivalence.java
* * <ul> * <li>{@code equivalent(x, x)} is true (<i>reflexive</i> property) * <li>{@code equivalent(x, y)} and {@code equivalent(y, x)} each return the same result * (<i>symmetric</i> property) * <li>If {@code equivalent(x, y)} and {@code equivalent(y, z)} are both true, then {@code * equivalent(x, z)} is also true (<i>transitive</i> property) * </ul> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu May 16 14:34:47 UTC 2024 - 13.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/prepare_quantize_dynamic_range.cc
quant_type = mlir::dyn_cast<quant::QuantizedType>( quant::GetUniformQuantizedPerAxisTypeForWeight( attr, affine_user.GetQuantizationDimIndex(), /*symmetric=*/true, bit_width, is_signed, is_narrow_range, is_legacy_float)); } else { quant_type = mlir::dyn_cast<quant::QuantizedType>( quant::GetUniformQuantizedTypeForWeight(
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 20.8K bytes - Viewed (0) -
src/sort/zsortinterface.go
} blockSize *= 2 } } // symMerge merges the two sorted subsequences data[a:m] and data[m:b] using // the SymMerge algorithm from Pok-Son Kim and Arne Kutzner, "Stable Minimum // Storage Merging by Symmetric Comparisons", in Susanne Albers and Tomasz // Radzik, editors, Algorithms - ESA 2004, volume 3221 of Lecture Notes in // Computer Science, pages 714-723. Springer, 2004. // // Let M = m-a and N = b-n. Wolog M < N.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 13 20:16:24 UTC 2022 - 11.2K bytes - Viewed (0) -
guava/src/com/google/common/base/Equivalence.java
* * <ul> * <li>{@code equivalent(x, x)} is true (<i>reflexive</i> property) * <li>{@code equivalent(x, y)} and {@code equivalent(y, x)} each return the same result * (<i>symmetric</i> property) * <li>If {@code equivalent(x, y)} and {@code equivalent(y, z)} are both true, then {@code * equivalent(x, z)} is also true (<i>transitive</i> property) * </ul> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 14.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/stablehlo/python/integration_test/quantize_model_test.py
module_str = self._extract_first_xla_call_module_op( self._output_saved_model_path ) # Tests that the output graph contains multiply for symmetric # dequantization. self.assertTrue(re.search('stablehlo.multiply', module_str)) # Tests that the output graph contains float dot_general. self.assertTrue(
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 14 06:31:57 UTC 2024 - 51.4K bytes - Viewed (0) -
cmd/endpoint-ellipses.go
setSize = setDriveCount } else { // Returns possible set counts with symmetry. setCounts = possibleSetCountsWithSymmetry(setCounts, argPatterns) if len(setCounts) == 0 { msg := fmt.Sprintf("No symmetric distribution detected with input endpoints provided %s, drives %d cannot be spread symmetrically by any supported erasure set sizes %d", args, commonSize, setSizes) return nil, config.ErrInvalidNumberOfErasureEndpoints(nil).Msg(msg)
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 14.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/legalize_tf.cc
mlir::StringAttr padding) { return llvm::StringSwitch<mlir::TFL::MirrorPaddingType>(padding.getValue()) .Case("REFLECT", mlir::TFL::MirrorPaddingType::REFLECT) .Case("SYMMETRIC", mlir::TFL::MirrorPaddingType::SYMMETRIC); } #include "tensorflow/compiler/mlir/lite/transforms/generated_legalize_tf.inc" #define DECL_CONVERT_OP(tf_op) \
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon May 20 20:06:54 UTC 2024 - 45.2K bytes - Viewed (0) -
src/math/big/int_test.go
for _, a := range sumZZ { arg := a testFunZZ(t, "AddZZ", AddZZ, arg) arg = argZZ{a.z, a.y, a.x} testFunZZ(t, "AddZZ symmetric", AddZZ, arg) arg = argZZ{a.x, a.z, a.y} testFunZZ(t, "SubZZ", SubZZ, arg) arg = argZZ{a.y, a.z, a.x} testFunZZ(t, "SubZZ symmetric", SubZZ, arg) } } func TestProdZZ(t *testing.T) { MulZZ := func(z, x, y *Int) *Int { return z.Mul(x, y) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 58.5K bytes - Viewed (0) -
src/sort/zsortfunc.go
} blockSize *= 2 } } // symMerge_func merges the two sorted subsequences data[a:m] and data[m:b] using // the SymMerge algorithm from Pok-Son Kim and Arne Kutzner, "Stable Minimum // Storage Merging by Symmetric Comparisons", in Susanne Albers and Tomasz // Radzik, editors, Algorithms - ESA 2004, volume 3221 of Lecture Notes in // Computer Science, pages 714-723. Springer, 2004. // // Let M = m-a and N = b-n. Wolog M < N.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 13 20:16:24 UTC 2022 - 11.5K bytes - Viewed (0) -
src/slices/zsortordered.go
} blockSize *= 2 } } // symMergeOrdered merges the two sorted subsequences data[a:m] and data[m:b] using // the SymMerge algorithm from Pok-Son Kim and Arne Kutzner, "Stable Minimum // Storage Merging by Symmetric Comparisons", in Susanne Albers and Tomasz // Radzik, editors, Algorithms - ESA 2004, volume 3221 of Lecture Notes in // Computer Science, pages 714-723. Springer, 2004. // // Let M = m-a and N = b-n. Wolog M < N.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 23 23:33:29 UTC 2023 - 12.4K bytes - Viewed (0)