- Sort Score
- Num 10 results
- Language All
Results 1 - 3 of 3 for cosa (0.05 seconds)
-
RELEASE.md
* Enable JIT-compiled i64-indexed kernels on GPU for large tensors with more than 2**32 elements. * Unary GPU kernels: Abs, Atanh, Acos, Acosh, Asin, Asinh, Atan, Cos, Cosh, Sin, Sinh, Tan, Tanh. * Binary GPU kernels: AddV2, Sub, Div, DivNoNan, Mul, MulNoNan, FloorDiv, Equal, NotEqual, Greater, GreaterEqual, LessEqual, Less. * `tf.lite`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) -
lib/fips140/v1.0.0-c2097c7c.zip
// We could do that by doubling _W * n times, or with a square-and-double // chain log2(_W * n) long. Turns out the fastest thing is to start out with // doublings, and switch to square-and-double once the exponent is large // enough to justify the cost of the multiplications. // The threshold is selected experimentally as a linear function of n. threshold := n / 4 // We calculate how many of the most-significant bits of the exponent we can // compute before crossing the threshold, and we do it with...
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) -
lib/fips140/v1.1.0-rc1.zip
// We could do that by doubling _W * n times, or with a square-and-double // chain log2(_W * n) long. Turns out the fastest thing is to start out with // doublings, and switch to square-and-double once the exponent is large // enough to justify the cost of the multiplications. // The threshold is selected experimentally as a linear function of n. threshold := n / 4 // We calculate how many of the most-significant bits of the exponent we can // compute before crossing the threshold, and we do it with...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0)