Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 4 of 4 for atMost (0.19 seconds)

  1. RELEASE.md

            canned Estimators`.
        *   `Estimator.export_savedmodel` has been renamed to `export_saved_model`.
        *   When saving to SavedModel, Estimators will strip default op attributes.
            This is almost always the correct behavior, as it is more forwards
            compatible, but if you require that default attributes to be saved with
            the model, please use `tf.compat.v1.Estimator`.
    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)
  2. okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt

    1DFC          ; valid                                  # 6.0  COMBINING DOUBLE INVERTED BREVE BELOW
    1DFD          ; valid                                  # 5.2  COMBINING ALMOST EQUAL TO BELOW
    1DFE..1DFF    ; valid                                  # 5.0  COMBINING LEFT ARROWHEAD ABOVE..COMBINING RIGHT ARROWHEAD AND DOWN ARROWHEAD BELOW
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sat Feb 10 11:25:47 GMT 2024
    - 854.1K bytes
    - Click Count (0)
  3. lib/fips140/v1.26.0.zip

    } // Finally for Step 7 we copy the final T window into x, and subtract m // if necessary (which as explained in maybeSubtractModulus can be the // case both if x >= m, or if x overflowed). // // The paper suggests in Section 4 that we can do an "Almost Montgomery // Multiplication" by subtracting only in the overflow case, but the // cost is very similar since the constant time subtraction tells us if // x >= m as a side effect, and taking care of the broken invariant is // highly undesirable (see...
    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)
  4. lib/fips140/v1.0.0-c2097c7c.zip

    } // Finally for Step 7 we copy the final T window into x, and subtract m // if necessary (which as explained in maybeSubtractModulus can be the // case both if x >= m, or if x overflowed). // // The paper suggests in Section 4 that we can do an "Almost Montgomery // Multiplication" by subtracting only in the overflow case, but the // cost is very similar since the constant time subtraction tells us if // x >= m as a side effect, and taking care of the broken invariant is // highly undesirable (see...
    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)
Back to Top