Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for Averaged (0.07 sec)

  1. RELEASE.md

        bounds when loading a specially crafted `SavedModel`
        ([CVE-2020-26271](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2020-26271))
    *   Solves an OOM issue on TPUs when XLA contexts use fused average updates
    *   Updates `libjpeg-turbo` to `2.0.5` to handle
        [CVE-2020-13790](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2020-13790).
    *   Updates `junit` to `4.13.1` to handle
    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

    - Fix missing `-c` shorthand for `--container` flag of `kubectl alpha debug` ([#89674](https://github.com/kubernetes/kubernetes/pull/89674), [@superbrothers](https://github.com/superbrothers)) [SIG CLI]
    - Fix printers ignoring object average value ([#89142](https://github.com/kubernetes/kubernetes/pull/89142), [@zhouya0](https://github.com/zhouya0)) [SIG API Machinery]
    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

    // indeed that's what both the original RSA paper and the pre-FIPS // crypto/rsa implementation did. // // However, FIPS 186-5, A.1.1(3) requires computing it as e⁻¹ mod λ(N) // where λ(N) = lcm(p-1, q-1). // // This makes d smaller by 1.5 bits on average, which is irrelevant both // because we exclusively use the CRT for private operations and because // we use constant time windowed exponentiation. On the other hand, it // requires computing a GCD of two values that are not coprime, and then // a...
    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

    // indeed that's what both the original RSA paper and the pre-FIPS // crypto/rsa implementation did. // // However, FIPS 186-5, A.1.1(3) requires computing it as e⁻¹ mod λ(N) // where λ(N) = lcm(p-1, q-1). // // This makes d smaller by 1.5 bits on average, which is irrelevant both // because we exclusively use the CRT for private operations and because // we use constant time windowed exponentiation. On the other hand, it // requires computing a GCD of two values that are not coprime, and then // a...
    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