Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for significantly (0.09 sec)

  1. RELEASE.md

        checkpoints continue to be readable; controlled by the `write_version`
        argument, `tf.train.Saver` now by default writes out in the new V2 format.
        It significantly reduces the peak memory required and latency incurred
        during restore.
    *   Added a new library for library of matrix-free (iterative) solvers for
    Registered: Tue Dec 30 12:39:10 UTC 2025
    - Last Modified: Tue Oct 28 22:27:41 UTC 2025
    - 740.4K bytes
    - Viewed (3)
  2. CHANGELOG/CHANGELOG-1.19.md

    ### Immutable Secrets and ConfigMaps (beta)
    
    Secret and ConfigMap volumes can be marked as immutable, which significantly reduces load on the API server if there are many Secret and ConfigMap volumes in the cluster.
    Registered: Fri Dec 26 09:05:12 UTC 2025
    - Last Modified: Wed Jan 05 05:42:32 UTC 2022
    - 489.7K bytes
    - Viewed (0)
  3. lib/fips140/v1.0.0-c2097c7c.zip

    large the value of x is. // // The output will be resized to the size of m and overwritten. // //go:norace func (out *Nat) Mod(x *Nat, m *Modulus) *Nat { out.resetFor(m) // Working our way from the most significant to the least significant limb, // we can insert each limb at the least significant position, shifting all // previous limbs left by _W. This way each limb will get shifted by the // correct number of bits. We can insert at least N - 1 limbs without // overflowing m. After that, we need...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Sep 25 19:53:19 UTC 2025
    - 642.7K bytes
    - Viewed (0)
  4. lib/fips140/v1.1.0-rc1.zip

    large the value of x is. // // The output will be resized to the size of m and overwritten. // //go:norace func (out *Nat) Mod(x *Nat, m *Modulus) *Nat { out.resetFor(m) // Working our way from the most significant to the least significant limb, // we can insert each limb at the least significant position, shifting all // previous limbs left by _W. This way each limb will get shifted by the // correct number of bits. We can insert at least N - 1 limbs without // overflowing m. After that, we need...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Dec 11 16:27:41 UTC 2025
    - 663K bytes
    - Viewed (0)
Back to top