- Sort Score
- Num 10 results
- Language All
Results 1 - 7 of 7 for sampla (0.08 seconds)
-
RELEASE.md
relies on the exact name of the layer. * Huber loss function has been updated to be consistent with other Keras losses. It now computes mean over the last axis of per-sample losses before applying the reduction function. * AutoGraph no longer converts functions passed to `tf.py_function`, `tf.py_func` and `tf.numpy_function`.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) -
docs/en/docs/release-notes.md
* **Safer** types. * Better **performance** and **less energy** consumption. * Better **extensibility**. * etc. ...all this while keeping the **same Python API**. In most of the cases, for simple models, you can simply upgrade the Pydantic version and get all the benefits. 🚀 In some cases, for pure data validation and processing, you can get performance improvements of **20x** or more. This means 2,000% or more. 🤯
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Apr 03 12:07:04 GMT 2026 - 631K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.19.md
### Documentation - Updated the instructions for deploying the sample app. ([#82785](https://github.com/kubernetes/kubernetes/pull/82785), [@ashish-billore](https://github.com/ashish-billore)) [SIG API Machinery] ### Failing Test
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Wed Jan 05 05:42:32 GMT 2022 - 489.7K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
Step 2 and then // discards it in Step 6. d := bLimbs[i] c1 := addMulVVW(T[i:n+i], aLimbs, d) // Step 6 is 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...
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) -
src/main/java/org/codelibs/fess/mylasta/direction/FessConfig.java
* @throws NumberFormatException When the property is not integer. */ Integer getLogNotificationIntervalAsInteger(); /** * The simple implementation for configuration. * @author FreeGen */ public static class SimpleImpl extends FessEnv.SimpleImpl implements FessConfig {Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Mar 28 06:59:19 GMT 2026 - 576.9K bytes - Click Count (2) -
src/main/webapp/css/bootstrap.min.css.map
0;\n}\n\n::-webkit-inner-spin-button {\n height: auto;\n}\n\n// 1. Correct the outline style in Safari.\n// 2. This overrides the extra rounded corners on search inputs in iOS so that our\n// `.form-control` class can properly style them. Note that this cannot simply\n// be added to `.form-control` as it's not specific enough. For details, see\n// https://github.com/twbs/bootstrap/issues/11586.\n\n[type=\"search\"] {\n outline-offset: -2px; // 1\n -webkit-appearance: textfield; // 2\n}\n\n// 1. A few input...Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Jan 12 06:14:02 GMT 2025 - 575.5K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
Step 2 and then // discards it in Step 6. d := bLimbs[i] c1 := addMulVVW(T[i:n+i], aLimbs, d) // Step 6 is 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...
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)