Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for closing (0.07 seconds)

  1. RELEASE.md

        *   Update `Fingerprint64Map` to use aliases
        *   Add legacy string flat hash map op kernels.
        *   Add support for `add_metric` in the graph function mode.
        *   Updating cosine similarity loss - removed the negate sign from cosine
            similarity.
        *   Changed default for gradient accumulation for TPU embeddings to true.
        *   Adds summary trace API for collecting graph and profile information.
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
  2. lib/fips140/v1.0.0-c2097c7c.zip

    is large // enough to justify the cost of the multiplications. // The threshold is selected experimentally as a linear function of n. threshold := n / 4 // We calculate how many of the most-significant bits of the exponent we can // compute before crossing the threshold, and we do it with doublings. i := bits.UintSize for logR>>i <= threshold { i-- } for k := uint(0); k < logR>>i; k++ { rr.Add(rr, m) } // Then we process the remaining bits of the exponent with a // square-and-double chain. for i >...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  3. lib/fips140/v1.1.0-rc1.zip

    is large // enough to justify the cost of the multiplications. // The threshold is selected experimentally as a linear function of n. threshold := n / 4 // We calculate how many of the most-significant bits of the exponent we can // compute before crossing the threshold, and we do it with doublings. i := bits.UintSize for logR>>i <= threshold { i-- } for k := uint(0); k < logR>>i; k++ { rr.Add(rr, m) } // Then we process the remaining bits of the exponent with a // square-and-double chain. for i >...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top