Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for underflow (0.1 seconds)

  1. lib/fips140/v1.26.0.zip

    > m even if x < m. // // x and m operands must have the same announced length. // //go:norace func (x *Nat) maybeSubtractModulus(always choice, m *Modulus) { t := NewNat().set(x) underflow := t.sub(m.nat) // We keep the result if x - m didn't underflow (meaning x >= m) // or if always was set. keep := not(choice(underflow)) | choice(always) x.assign(keep, t) } // Sub computes x = x - y mod m. // // The length of both operands must be the same as the modulus. Both operands // must already be reduced...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 08 17:58:32 GMT 2026
    - 660.3K bytes
    - Click Count (0)
  2. lib/fips140/v1.0.0-c2097c7c.zip

    > m even if x < m. // // x and m operands must have the same announced length. // //go:norace func (x *Nat) maybeSubtractModulus(always choice, m *Modulus) { t := NewNat().set(x) underflow := t.sub(m.nat) // We keep the result if x - m didn't underflow (meaning x >= m) // or if always was set. keep := not(choice(underflow)) | choice(always) x.assign(keep, t) } // Sub computes x = x - y mod m. // // The length of both operands must be the same as the modulus. Both operands // must already be reduced...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  3. RELEASE.md

            `TransformedDistribution`.
        *   Fix a bug in `import_meta_graph`'s handling of partitioned variables
            when
        *   Ensure `tf.distributions.Multinomial` doesn't underflow in `log_prob`.
            Before this change, all partitions of an integer variable were
            initialized with the shape of the unpartitioned variable; after this
            change they are initialized correctly.
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Mon Mar 30 18:31:38 GMT 2026
    - 746.5K bytes
    - Click Count (3)
Back to Top