Log in
Enquire now
‌

US Patent 10936569 Efficient and scalable computations with sparse tensors

OverviewStructured DataIssuesContributors
Is a
Patent
Patent
Date Filed
May 20, 2013
Date of Patent
March 2, 2021
Patent Application Number
13898159
Patent Citations Received
‌
US Patent 11544545 Structured activation based sparsity in an artificial neural network
0
‌
US Patent 11551028 Structured weight based sparsity in an artificial neural network
‌
US Patent 11573945 Efficient and scalable storage of sparse tensors
0
‌
US Patent 11461614 Data driven quantization optimization of weights and input data in an artificial neural network
‌
US Patent 11461615 System and method of memory access of multi-dimensional data
‌
US Patent 11514291 Neural network processing element incorporating compute and local memory elements
‌
US Patent 11537687 Spatial locality transform of matrices
0
‌
US Patent 11315007 Neural network scheduling mechanism
0
‌
US Patent 11354563 Configurable and programmable sliding window based memory access in a neural network processor
‌
US Patent 11868804 Processor instruction dispatch configuration
0
•••
Patent Inventor Names
Benoit J. Meister
0
Muthu Manikandan Baskaran
0
Nicolas T. Vasilache
0
Richard A. Lethin
0
Patent Jurisdiction
United States Patent and Trademark Office
United States Patent and Trademark Office
Patent Number
10936569
Patent Primary Examiner
‌
Jean M Corrielus

Find more entities like US Patent 10936569 Efficient and scalable computations with sparse tensors

Use the Golden Query Tool to find similar entities by any field in the Knowledge Graph, including industry, location, and more.
Open Query Tool
Access by API
Golden Query Tool
Golden logo

Company

  • Home
  • Press & Media
  • Blog
  • Careers
  • WE'RE HIRING

Products

  • Knowledge Graph
  • Query Tool
  • Data Requests
  • Knowledge Storage
  • API
  • Pricing
  • Enterprise
  • ChatGPT Plugin

Legal

  • Terms of Service
  • Enterprise Terms of Service
  • Privacy Policy

Help

  • Help center
  • API Documentation
  • Contact Us
By using this site, you agree to our Terms of Service.