Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 4 of 4 for somex (0.06 seconds)

  1. RELEASE.md

            for all the RNG in Keras. We plan to switch on the new code path by
            default in tf 2.8, and the behavior change will likely to cause some
            breakage on user side (eg if the test is checking against some golden
            number). These 3 APIs will allow user to disable and switch back to
            legacy behavior if they prefer. In future (eg TF 2.10), we expect to
    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. docs/en/docs/release-notes.md

    In some cases, for pure data validation and processing, you can get performance improvements of **20x** or more. This means 2,000% or more. 🤯
    
    When you use **FastAPI**, there's a lot more going on, processing the request and response, handling dependencies, executing **your own code**, and particularly, **waiting for the network**. But you will probably still get some nice performance improvements just from the upgrade.
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sat Dec 27 19:06:15 GMT 2025
    - 586.7K bytes
    - Click Count (0)
  3. lib/fips140/v1.0.0-c2097c7c.zip

    has a complete list of false witnesses for 65 = 0x41 and # 85 = 0x55. # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 41 B = 8 # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 41 B = 12 # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 41 B = 2f # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 41 B = 39 # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 55 B = d # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 55 B = 26 # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 55 B = 2f # Some b^(m*2^j)...
    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)
  4. lib/fips140/v1.1.0-rc1.zip

    has a complete list of false witnesses for 65 = 0x41 and # 85 = 0x55. # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 41 B = 8 # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 41 B = 12 # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 41 B = 2f # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 41 B = 39 # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 55 B = d # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 55 B = 26 # Some b^(m*2^j) = w-1 Result = PossiblyPrime W = 55 B = 2f # Some b^(m*2^j)...
    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