- Sort Score
- Result 10 results
- Languages All
Results 161 - 163 of 163 for mentions (0.06 sec)
-
RELEASE.md
version is LLVM/clang 17. The official Wheels-published on PyPI will be based on Clang; however, users retain the option to build wheels using the MSVC compiler following the steps mentioned in https://www.tensorflow.org/install/source_windows as has been the case before ### Breaking Changes * `tf.summary.trace_on` now takes a `profiler_outdir` argument. This must be
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Mon Aug 18 20:54:38 UTC 2025 - 740K bytes - Viewed (2) -
api/go1.txt
pkg debug/elf, type DynFlag int pkg debug/elf, type DynTag int pkg debug/elf, type File struct pkg debug/elf, type File struct, Progs []*Prog pkg debug/elf, type File struct, Sections []*Section pkg debug/elf, type File struct, embedded FileHeader pkg debug/elf, type FileHeader struct pkg debug/elf, type FileHeader struct, ABIVersion uint8
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Aug 14 18:58:28 UTC 2013 - 1.7M bytes - Viewed (0) -
lib/fips140/v1.0.0.zip
replaced by shifting the virtual window we operate // over: T of the algorithm is T[i:] for us. That means that T1 in // Step 2 (T mod 2^_W) is simply T[i]. k0 in Step 3 is our m0inv. Y := T[i] * m.m0inv // Step 4 and 5 add Y × m to T, which as mentioned above is stored // at T[i:]. The two carries (from a × d and Y × m) are added up in // the next word T[n+i], and the carry bit from that addition is // brought forward to the next iteration. c2 := addMulVVW(T[i:n+i], mLimbs, Y) T[n+i], c = bits.Add(c1,...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0)