Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for We (0.06 seconds)

  1. RELEASE.md

    *   Added Text Dashboard to TensorBoard.
    
    ## Deprecations
    
    *   TensorFlow 1.1.0 will be the last time we release a binary with Mac GPU
        support. Going forward, we will stop testing on Mac GPU systems. We continue
        to welcome patches that maintain Mac GPU support, and we will try to keep
        the Mac GPU build working.
    
    ## Changes to contrib APIs
    
    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.1.0-rc1.zip

    uint(len(rr.limbs)) mLen := uint(m.BitLen()) logR := _W * n // We start by computing R = 2^(_W * n) mod m. We can get pretty close, to // 2^⌊log₂m⌋, by setting the highest bit we can without having to reduce. rr.limbs[n-1] = 1 << ((mLen - 1) % _W) // Then we double until we reach 2^(_W * n). for i := mLen - 1; i < logR; i++ { rr.Add(rr, m) } // Next we need to get from R to 2^(_W * n) R mod m (aka from one to R in // the Montgomery domain, meaning we can use Montgomery multiplication now). // We could do...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
  3. lib/fips140/v1.0.0-c2097c7c.zip

    uint(len(rr.limbs)) mLen := uint(m.BitLen()) logR := _W * n // We start by computing R = 2^(_W * n) mod m. We can get pretty close, to // 2^⌊log₂m⌋, by setting the highest bit we can without having to reduce. rr.limbs[n-1] = 1 << ((mLen - 1) % _W) // Then we double until we reach 2^(_W * n). for i := mLen - 1; i < logR; i++ { rr.Add(rr, m) } // Next we need to get from R to 2^(_W * n) R mod m (aka from one to R in // the Montgomery domain, meaning we can use Montgomery multiplication now). // We could do...
    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)
Back to Top