Patents by Inventor Sayan Bhattacharya

Sayan Bhattacharya 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).

  • Fulfilling queries using specified and unspecified attributes
    Patent number: 9053208
    Abstract: A query is received and processed to determine one or more specified and unspecified attributes in the query. The specified and unspecified attributes may correspond to attributes of one or more items. A graph is generated for the items and includes a node for each item and an edge between each unique pair of nodes. Each node is assigned a cost based on a distance between the specified attributes of the query and the attributes of the item associated with the node. Each edge is assigned a weight based on a distance between the unspecified attributes associated with the nodes of the node pair corresponding to the edge. A set of nodes from the graph is selected by minimizing a total cost of the nodes while maximizing a dispersion of the nodes based on the edge weights.
    Type: Grant
    Filed: March 2, 2011
    Date of Patent: June 9, 2015
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Sreenivas Gollapudi, Sayan Bhattacharya
  • FULFILLING QUERIES USING SPECIFIED AND UNSPECIFIED ATTRIBUTES
    Publication number: 20120226679
    Abstract: A query is received and processed to determine one or more specified and unspecified attributes in the query. The specified and unspecified attributes may correspond to attributes of one or more items. A graph is generated for the items and includes a node for each item and an edge between each unique pair of nodes. Each node is assigned a cost based on a distance between the specified attributes of the query and the attributes of the item associated with the node. Each edge is assigned a weight based on a distance between the unspecified attributes associated with the nodes of the node pair corresponding to the edge. A set of nodes from the graph is selected by minimizing a total cost of the nodes while maximizing a dispersion of the nodes based on the edge weights.
    Type: Application
    Filed: March 2, 2011
    Publication date: September 6, 2012
    Applicant: Microsoft Corporation
    Inventors: Sreenivas Gollapudi, Sayan Bhattacharya