Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 4 of 4 for efficiency (0.12 seconds)

  1. RELEASE.md

        `tf.name_scope` and `tf.variable_scope`. The new argument order of
        `tf.variable_scope` is incompatible with previous versions.
    *   Introducing `core/util/tensor_bundle` module: a module to efficiently
        serialize/deserialize tensors to disk. Will be used in TF's new checkpoint
        format.
    *   Added tf.svd for computing the singular value decomposition (SVD) of dense
    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)
  2. lib/fips140/v1.0.0-c2097c7c.zip

    table[i-1], table[0], m) } out.resetFor(m) out.limbs[0] = 1 out.montgomeryRepresenta(m) tmp := NewNat().ExpandFor(m) for _, b := range e { for _, j := range []int{4, 0} { // Square four times. Optimization note: this can be implemented // more efficiently than with generic Montgomery multiplication. out.montgomeryMul(out, out, m) out.montgomeryMul(out, out, m) out.montgomeryMul(out, out, m) out.montgomeryMul(out, out, m) // Select x^k in constant time from the table. k := uint((b >> j) & 0b1111)...
    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)
  3. CHANGELOG/CHANGELOG-1.19.md

    SIG Windows is also including several addition to this release:
     - Direct Server Return (DSR) mode support, allowing large numbers of services to scale up efficiently
     - Windows containers  now honor CPU limits
     - Performance improvements for collections of metrics and summary
    
    ### Increase the Kubernetes support window to one year
    
    Created: Fri Dec 26 09:05:12 GMT 2025
    - Last Modified: Wed Jan 05 05:42:32 GMT 2022
    - 489.7K bytes
    - Click Count (0)
  4. lib/fips140/v1.1.0-rc1.zip

    table[i-1], table[0], m) } out.resetFor(m) out.limbs[0] = 1 out.montgomeryRepresenta(m) tmp := NewNat().ExpandFor(m) for _, b := range e { for _, j := range []int{4, 0} { // Square four times. Optimization note: this can be implemented // more efficiently than with generic Montgomery multiplication. out.montgomeryMul(out, out, m) out.montgomeryMul(out, out, m) out.montgomeryMul(out, out, m) out.montgomeryMul(out, out, m) // Select x^k in constant time from the table. k := uint((b >> j) & 0b1111)...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top