Patents by Inventor Sanjay V. Addicam

Sanjay V. Addicam has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Methods and apparatus for subgraph matching in big data analysis
    Patent number: 11423082
    Abstract: Methods, apparatus, systems and articles of manufacture are disclosed to analyze graph information. An example apparatus includes a graph computational processor. The example graph computational processor is configured to analyze a first graph with respect to a second graph to identify a third graph within the first graph by: matching a first triplet from the first graph to a second triplet from the second graph by comparing each node and connecting edge included in each triplet; and generating the third graph by adding, when the first triplet matches the second triplet, the first triplet to a subgraph output set forming the third graph. The example graph computational processor of is configured to identify an additional node in the first graph based on the third graph and generate an output based on the additional node.
    Type: Grant
    Filed: June 29, 2016
    Date of Patent: August 23, 2022
    Assignee: Intel Corporation
    Inventors: Nikita M. Vikhe, Sanjay V. Addicam
  • METHODS AND APPARATUS FOR SUBGRAPH MATCHING IN BIG DATA ANALYSIS
    Publication number: 20180004751
    Abstract: Methods, apparatus, systems and articles of manufacture are disclosed to analyze graph information. An example apparatus includes a graph computational processor. The example graph computational processor is configured to analyze a first graph with respect to a second graph to identify a third graph within the first graph by: matching a first triplet from the first graph to a second triplet from the second graph by comparing each node and connecting edge included in each triplet; and generating the third graph by adding, when the first triplet matches the second triplet, the first triplet to a subgraph output set forming the third graph. The example graph computational processor of is configured to identify an additional node in the first graph based on the third graph and generate an output based on the additional node.
    Type: Application
    Filed: June 29, 2016
    Publication date: January 4, 2018
    Inventors: Nikita M. Vikhe, Sanjay V. Addicam