Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for worse (0.04 sec)

  1. RELEASE.md

            and `tf.keras.layers.LocallyConnected1D`. The new mode
            (`implementation=2`) performs forward pass as a single dense matrix
            multiplication, allowing dramatic speedups in certain scenarios (but
            worse performance in others - see docstring). The option also allows to
            use `padding=same`.
        *   Add documentation clarifying the differences between tf.fill and
            tf.constant.
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Aug 18 20:54:38 UTC 2025
    - 740K bytes
    - Viewed (2)
  2. okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt

    2FB9          ; mapped                 ; 9999          # 3.0  KANGXI RADICAL FRAGRANT
    2FBA          ; mapped                 ; 99AC          # 3.0  KANGXI RADICAL HORSE
    2FBB          ; mapped                 ; 9AA8          # 3.0  KANGXI RADICAL BONE
    2FBC          ; mapped                 ; 9AD8          # 3.0  KANGXI RADICAL TALL
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Sat Feb 10 11:25:47 UTC 2024
    - 854.1K bytes
    - Viewed (0)
  3. lib/fips140/v1.0.0.zip

    186-5, Section 6.4.1, point 2 and Section 6.4.2, point 3. func hashToNat[P Point[P]](c *Curve[P], e *bigmod.Nat, hash []byte) { // ECDSA asks us to take the left-most log2(N) bits of hash, and use them as // an integer modulo N. This is the absolute worst of all worlds: we still // have to reduce, because the result might still overflow N, but to take // the left-most bits for P-521 we have to do a right shift. if size := c.N.Size(); len(hash) >= size { hash = hash[:size] if excess := len(hash)*8 -...
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Jan 29 15:10:35 UTC 2025
    - 635K bytes
    - Viewed (0)
Back to top