Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for mdfind (0.12 sec)

  1. RELEASE.md

            -  If you believe it should definitely be a public Keras API, please open a feature request in keras GitHub repo.
            -  As a workaround, you could import the same private symbol keras `keras.src`, but keep in mind the `src` namespace is not stable and those APIs may change or be removed in the future.
    
    ### Major Features and Improvements
    
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Aug 18 20:54:38 UTC 2025
    - 740K bytes
    - Viewed (1)
  2. CHANGELOG/CHANGELOG-1.19.md

      - bazel: Replace --features with Starlark build settings flag
      - hack/lib/util.sh: some bash cleanups
        
        - switched one spot to use kube::logging
        - make kube::util::find-binary return an error when it doesn't find
          anything so that hack scripts fail fast instead of with '' binary not
          found errors.
        - this required deleting some genfeddoc stuff. the binary no longer
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Wed Jan 05 05:42:32 UTC 2022
    - 489.7K bytes
    - Viewed (0)
  3. docs/en/docs/release-notes.md

    * 📝 Add External Link: ML serving and monitoring with FastAPI and Evidently. PR [#9701](https://github.com/tiangolo/fastapi/pull/9701) by [@mnrozhkov](https://github.com/mnrozhkov).
    * 📝 Reword in docs, from "have in mind" to "keep in mind". PR [#10376](https://github.com/tiangolo/fastapi/pull/10376) by [@malicious](https://github.com/malicious).
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Fri Sep 05 12:48:45 UTC 2025
    - 544.1K bytes
    - Viewed (0)
  4. lib/fips140/v1.0.0.zip

    additions). basepointNafTable := basepointNafTable() var aTable nafLookupTable5 aTable.FromP3(A) // Because the basepoint is fixed, we can use a wider NAF // corresponding to a bigger table. aNaf := a.nonAdjacentForm(5) bNaf := b.nonAdjacentForm(8) // Find the first nonzero coefficient. i := 255 for j := i; j >= 0; j-- { if aNaf[j] != 0 || bNaf[j] != 0 { break } } multA := &projCached{} multB := &affineCached{} tmp1 := &projP1xP1{} tmp2 := &projP2{} tmp2.Zero() // Move from high to low bits, doubling...
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Jan 29 15:10:35 UTC 2025
    - 635K bytes
    - Viewed (0)
Back to top