Patents by Inventor Deepti Aggarwal

Deepti Aggarwal 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).

  • Publication number: 20240103865
    Abstract: Techniques for using and/or supporting multiplication with add and/or subtract instructions with an intermediate (after multiplication) round are described. In some examples, an instruction at least having one or more fields for an opcode and location information for three packed data source operands, wherein the opcode is to indicate execution circuitry is to perform, per packed data element position, a multiplication, a round, addition and/or subtraction, and a round, using the three packed data source operands and storage into a corresponding packed data element position of an identified destination location, wherein which packed data element positions are to be added and subtracted is defined by the opcode is supported.
    Type: Application
    Filed: March 30, 2023
    Publication date: March 28, 2024
    Inventors: Michael ESPIG, Mikko BYCKLING, Maxim LOKTYUKHIN, Dmitry Yurievich BABOKIN, Amit GRADSTEIN, Deepti AGGARWAL
  • Publication number: 20240103872
    Abstract: Techniques for performing floating-point to integer conversion with saturation are described. In some examples, an instruction is executed to perform the conversion. In some examples, a single instruction to include at least one or more fields for an opcode and one or more fields for location information for at least a first source operand and a destination operand, wherein the opcode is to indicate execution circuitry is to convert, using truncation or saturation, each floating-point data element of at least the first source operand to an integer value and store the integer value into a corresponding data element position of the destination operand, wherein truncation is to be used when a conversion is inexact and saturation is to be used when a conversion overflows.
    Type: Application
    Filed: March 29, 2023
    Publication date: March 28, 2024
    Inventors: John MORGAN, Deepti AGGARWAL, Michael ESPIG
  • Publication number: 20240103866
    Abstract: Detailed herein are examples of instructions and their hardware support for floating-point comparison that makes use of the distinction between signed integer comparison and unsigned integer comparison to make an analogous distinction between floating-point relationships including unordered and those that do not. These instructions may reduce the number of instructions required to compare and conditionally execute operations in a program, including instructions to load values and instructions to explicitly test for the unordered condition.
    Type: Application
    Filed: July 1, 2023
    Publication date: March 28, 2024
    Inventors: John MORGAN, Deepti AGGARWAL, Michael ESPIG, H. Peter ANVIN
  • Publication number: 20230388272
    Abstract: A computer implemented method includes intercepting a packet in a mobile device, the packet having a destination network address. A first virtual private network (VPN) plugin for which the packet is intended is identified out of multiple active VPN plugins. The packet is forwarded to the first VPN plugin. The first packet is forwarded via the VPN tunnel while keeping other VPNs having corresponding other plugins active, enabling multiple remote VPN connections using just one VPN tunnel.
    Type: Application
    Filed: May 31, 2022
    Publication date: November 30, 2023
    Inventors: Pankaj Kumar MADHUKAR, Tushar GUPTA, Deepti AGGARWAL, Gaurav KUMAR
  • Publication number: 20230185873
    Abstract: Methods and apparatus relating to separable convolution filter operations on matrix multiplication arrays are described. In an embodiment, logic circuitry generates a first convolution kernel and a second convolution kernel based on a two-dimensional convolution kernel. A matrix processing array comprising a plurality of Fused Multiply-Add (FMA) blocks applies the first convolution kernel to input data during a first pass to generate an intermediate data and the matrix processing array applies the second convolution kernel to the intermediate data to generate output data. Other embodiments are also disclosed and claimed.
    Type: Application
    Filed: December 10, 2021
    Publication date: June 15, 2023
    Applicant: Intel Corporation
    Inventors: Michael Espig, Deepti Aggarwal
  • Publication number: 20230066617
    Abstract: Methods and systems for securing unstructured data are provided. One method includes generating, by a processor, a schema from unstructured data, the schema including one or more relationships between named entities of the unstructured data; identifying, by the processor, a plurality of semantic relationships between the named entities; determining, by the processor, a sensitive relationship from the plurality of semantic relationships; and anonymizing, by the processor, sensitive data associated with the sensitive relationship by replacing, a first portion of the sensitive data with generalized information.
    Type: Application
    Filed: November 3, 2022
    Publication date: March 2, 2023
    Inventors: Deepti Aggarwal, Jayanta Basak
  • Publication number: 20220413853
    Abstract: Systems, methods, and apparatuses to support packed data convolution instructions with shift control and width control are described.
    Type: Application
    Filed: June 25, 2021
    Publication date: December 29, 2022
    Inventors: DEEPTI AGGARWAL, MICHAEL ESPIG, ROBERT VALENTINE, SUMIT MOHAN, PRAKARAM JOSHI, RICHARD WINTERTON
  • Patent number: 11520929
    Abstract: Methods and systems for securing unstructured data are provided. One method includes generating, by a processor, a schema from unstructured data, the schema including one or more relationships between named entities of the unstructured data; identifying, by the processor, a plurality of semantic relationships between the named entities; determining, by the processor, a sensitive relationship from the plurality of semantic relationships; and anonymizing, by the processor, sensitive data associated with the sensitive relationship by replacing, a first portion of the sensitive data with generalized information.
    Type: Grant
    Filed: December 15, 2020
    Date of Patent: December 6, 2022
    Assignee: NETAPP, INC.
    Inventors: Deepti Aggarwal, Jayanta Basak
  • Publication number: 20220308881
    Abstract: In an embodiment, a processor includes: a fetch circuit to fetch instructions, the instructions including a sum of absolute differences (SAD) instruction; a decode circuit to decode the SAD instruction; and an execution circuit to, during an execution of the decoded SAD instruction, generate an SAD output vector based on a plurality of input vectors, the SAD output vector including a plurality of absolute differences values. Other embodiments are described and claimed.
    Type: Application
    Filed: March 26, 2021
    Publication date: September 29, 2022
    Inventors: Deepti Aggarwal, Michael Espig, Robert Valentine, Mark Charney
  • Publication number: 20220197635
    Abstract: In an embodiment, a processor includes: a fetch circuit to fetch instructions, the instructions including a sum of squared differences (SSD) instruction; a decode circuit to decode the SSD instruction; and an execution circuit to, during an execution of the decoded SSD instruction, generate an SSD output vector based on a plurality of input vectors, the SSD output vector including a plurality of squared differences values. Other embodiments are described and claimed.
    Type: Application
    Filed: December 23, 2020
    Publication date: June 23, 2022
    Inventors: Deepti AGGARWAL, Michael ESPIG, Chekib NOUIRA, Robert VALENTINE, Mark CHARNEY
  • Publication number: 20220188454
    Abstract: Methods and systems for securing unstructured data are provided. One method includes generating, by a processor, a schema from unstructured data, the schema including one or more relationships between named entities of the unstructured data; identifying, by the processor, a plurality of semantic relationships between the named entities; determining, by the processor, a sensitive relationship from the plurality of semantic relationships; and anonymizing, by the processor, sensitive data associated with the sensitive relationship by replacing, a first portion of the sensitive data with generalized information.
    Type: Application
    Filed: December 15, 2020
    Publication date: June 16, 2022
    Applicant: NETAPP, INC.
    Inventors: Deepti Aggarwal, Jayanta Basak
  • Patent number: 10970595
    Abstract: Methods and systems for document classification are provided. One method includes generating by a processor, a plurality of topics using content of a plurality of electronic documents, where each topic includes a plurality of words associated with the plurality of electronic documents; reducing by the processor, the plurality of topics to a subset of topics to represent the plurality of electronic documents based on a parameter indicating a property of each subset topic and separation between the subset topics; automatically generating by the processor, a tag for each subset topic, based on the tag's position within the subset topic; wherein each tag is an attribute of each subset topic; storing by the processor, the subset of topics with corresponding tags in a model data structure; and updating the model data structure by the processor based on one of a new topic and a new tag associated with an electronic document.
    Type: Grant
    Filed: February 21, 2019
    Date of Patent: April 6, 2021
    Assignee: NETAPP, INC.
    Inventors: Deepti Aggarwal, Jayanta Basak, Siddhartha Nandi
  • Publication number: 20190392250
    Abstract: Methods and systems for document classification are provided. One method includes generating by a processor, a plurality of topics using content of a plurality of electronic documents, where each topic includes a plurality of words associated with the plurality of electronic documents; reducing by the processor, the plurality of topics to a subset of topics to represent the plurality of electronic documents based on a parameter indicating a property of each subset topic and separation between the subset topics; automatically generating by the processor, a tag for each subset topic, based on the tag's position within the subset topic; wherein each tag is an attribute of each subset topic; storing by the processor, the subset of topics with corresponding tags in a model data structure; and updating the model data structure by the processor based on one of a new topic and a new tag associated with an electronic document.
    Type: Application
    Filed: February 21, 2019
    Publication date: December 26, 2019
    Applicant: NETAPP, INC.
    Inventors: Deepti Aggarwal, Jayanta Basak, Siddhartha Nandi