Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 12 for Products (0.18 sec)

  1. tensorflow/c/eager/c_api_test.cc

      ASSERT_EQ(TF_OK, TF_GetCode(status)) << TF_Message(status);
      float product[4] = {0};
      EXPECT_EQ(sizeof(product), TF_TensorByteSize(t));
      memcpy(&product[0], TF_TensorData(t), TF_TensorByteSize(t));
      TF_DeleteTensor(t);
      EXPECT_EQ(7, product[0]);
      EXPECT_EQ(10, product[1]);
      EXPECT_EQ(15, product[2]);
      EXPECT_EQ(22, product[3]);
      TF_DeleteStatus(status);
    }
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Thu Aug 03 20:50:20 GMT 2023
    - 94.6K bytes
    - Viewed (1)
  2. tensorflow/c/eager/c_api_experimental_test.cc

      ASSERT_EQ(TF_OK, TF_GetCode(status)) << TF_Message(status);
      float product[4] = {0};
      EXPECT_EQ(sizeof(product), TF_TensorByteSize(t));
      memcpy(&product[0], TF_TensorData(t), TF_TensorByteSize(t));
      TF_DeleteTensor(t);
      EXPECT_EQ(7, product[0]);
      EXPECT_EQ(10, product[1]);
      EXPECT_EQ(15, product[2]);
      EXPECT_EQ(22, product[3]);
      TF_DeleteStatus(status);
    }
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Thu Aug 03 03:14:26 GMT 2023
    - 31.5K bytes
    - Viewed (1)
  3. tensorflow/c/eager/tape.h

      explicit ForwardFunction(lambda_type lambda)
          : std::function<Status(const std::vector<Gradient*>&,
                                 std::vector<Gradient*>*, bool)>(lambda) {}
    };
    
    // Computes Jacobian-vector products using forward-mode automatic
    // differentiation.
    //
    // While GradientTape's RecordOperation is trivial, ForwardAccumulator's
    // Accumulate runs the gradient computation immediately.
    //
    C
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Tue Apr 02 12:40:29 GMT 2024
    - 47.2K bytes
    - Viewed (1)
  4. tensorflow/BUILD

        get_compat_files(TENSORFLOW_API_INIT_FILES_V1, 1) + get_nested_compat_files([
            1,
            2,
        ])
    )
    # copybara:comment_end
    
    # Config setting used when building for products
    # which requires restricted licenses to be avoided.
    config_setting(
        name = "no_lgpl_deps",
        define_values = {"__TENSORFLOW_NO_LGPL_DEPS__": "1"},
        visibility = ["//visibility:public"],
    )
    
    Plain Text
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Tue Apr 09 18:15:11 GMT 2024
    - 53.4K bytes
    - Viewed (8)
  5. tensorflow/c/eager/c_api.h

    // will block till the operation that produces `h` has completed.
    TF_CAPI_EXPORT extern const char* TFE_TensorHandleDeviceName(
        TFE_TensorHandle* h, TF_Status* status);
    
    // Returns the name of the device in whose memory `h` resides.
    //
    // This function will block till the operation that produces `h` has completed.
    TF_CAPI_EXPORT extern const char* TFE_TensorHandleBackingDeviceName(
    C
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Thu Apr 27 21:07:00 GMT 2023
    - 22.8K bytes
    - Viewed (1)
  6. .github/ISSUE_TEMPLATE/tflite-converter-issue.md

    ```
    
    ### 3. Failure after conversion
    If the conversion is successful, but the generated model is wrong, then state what is wrong:
    
    - Model produces wrong results and/or has lesser accuracy.
    - Model produces correct results, but it is slower than expected.
    
    ### 4. (optional) RNN conversion support
    If converting TF RNN to TFLite fused RNN ops, please prefix [RNN] in the title.
    
    Plain Text
    - Registered: Tue May 07 12:40:20 GMT 2024
    - Last Modified: Wed Jun 15 03:35:58 GMT 2022
    - 2.1K bytes
    - Viewed (0)
  7. ci/official/requirements_updater/README.md

    ```
    
    ## Requirements updater
    
    Requirements updater is a standalone tool, intended to simplify process of
    updating requirements for multiple minor versions of Python.
    
    It takes in a file with a set of dependencies, and produces a more detailed
    requirements file for each version, with hashes specified for each
    dependency required, as well as their sub-dependencies.
    
    ### How to update/add requirements
    
    Plain Text
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Tue Jan 23 02:14:00 GMT 2024
    - 3.9K bytes
    - Viewed (1)
  8. tensorflow/c/eager/c_api_experimental.h

    // combined status.
    TF_CAPI_EXPORT extern void TFE_ContextAsyncWait(TFE_Context* ctx,
                                                    TF_Status* status);
    
    // This function will block till the operation that produces `h` has
    // completed. This is only valid on local TFE_TensorHandles. The pointer
    // returned will be on the device in which the TFE_TensorHandle resides (so e.g.
    C
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Wed Feb 21 22:37:46 GMT 2024
    - 39.5K bytes
    - Viewed (0)
  9. tensorflow/c/eager/gradients.h

      // eager tensors.
      void DeleteTrace(const AbstractTensorHandle*);
    
      // Consumes the internal state of the tape (so cannot be called more than
      // once unless the tape is persistent) and produces the gradient of the target
      // tensors with respect to the source tensors. The output gradients are used
      // if not empty and not null. The result is populated with one tensor per
      // target element.
    C
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Mon Sep 26 10:27:05 GMT 2022
    - 6.9K bytes
    - Viewed (0)
  10. LICENSE

          with Licensor regarding such Contributions.
    
       6. Trademarks. This License does not grant permission to use the trade
          names, trademarks, service marks, or product names of the Licensor,
          except as required for reasonable and customary use in describing the
          origin of the Work and reproducing the content of the NOTICE file.
    
    Plain Text
    - Registered: Tue May 07 12:40:20 GMT 2024
    - Last Modified: Mon Nov 29 17:31:56 GMT 2021
    - 13.3K bytes
    - Viewed (0)
Back to top