Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for boxed (0.06 seconds)

  1. RELEASE.md

                backwards. See PR
                [47925](https://github.com/tensorflow/tensorflow/pull/47925).
            *   `tf.image.crop_and_resize` gradient w.r.t. either `image` or
                `boxes`. See PR
                [48905](https://github.com/tensorflow/tensorflow/pull/48905).
            *   `tf.sparse.sparse_dense_matmul` forwards. See PR
                [50355](https://github.com/tensorflow/tensorflow/pull/50355).
    
    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

    s := uint8(0) for k := uint(0); k < 8; k++ { for l := uint(0); l < 8; l++ { if i&(1<<k) != 0 && j&(1<<l) != 0 { s ^= powx[k+l] } } } if x := mul(i, j); x != uint32(s) { t.Fatalf("mul(%#x, %#x) = %#x, want %#x", i, j, x, s) } } } } // Check that S-boxes are inverses of each other. // They have more structure that we could test, // but if this sanity check passes, we'll assume // the cut and paste from the FIPS PDF worked. func TestSboxes(t *testing.T) { for i := 0; i < 256; i++ { if j := sbox0[sbox1[i]];...
    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. lib/fips140/v1.1.0-rc1.zip

    s := uint8(0) for k := uint(0); k < 8; k++ { for l := uint(0); l < 8; l++ { if i&(1<<k) != 0 && j&(1<<l) != 0 { s ^= powx[k+l] } } } if x := mul(i, j); x != uint32(s) { t.Fatalf("mul(%#x, %#x) = %#x, want %#x", i, j, x, s) } } } } // Check that S-boxes are inverses of each other. // They have more structure that we could test, // but if this sanity check passes, we'll assume // the cut and paste from the FIPS PDF worked. func TestSboxes(t *testing.T) { for i := 0; i < 256; i++ { if j := sbox0[sbox1[i]];...
    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