Patents by Inventor Sreenivas Gollapudi
Sreenivas Gollapudi 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).
-
Patent number: 8825805Abstract: The present invention is directed to a method and mechanism for reducing the expense of data transmissions between a client and a server. According to an aspect of data prefetching is utilized to predictably retrieve information between the client and server. Another aspect pertains to data redundancy management for reducing the expense of transmitting and storing redundant data between the client and server. Another aspect relates to moved data structures for tracking and managing data at a client in conjunction with data redundancy management.Type: GrantFiled: April 25, 2006Date of Patent: September 2, 2014Assignee: Oracle International CorporationInventors: Sreenivas Gollapudi, Debashish Chatterjee
-
Patent number: 8666920Abstract: Sketches are generated for each node in a graph. For undirected graphs, each sketch for a node may include an indicator of a node from a seed set of nodes and the shortest distance between the node and the indicated node. When a request is received for the shortest distance between two nodes of the graph, the sketches for each of the two nodes are retrieved, and nodes that are indicated in both of the sketches are determined. The distances between each of the two nodes and a determined node as indicated in the sketches is summed for each of the determined nodes, and the sum having the least distance is selected as the estimated shortest distance between the two nodes.Type: GrantFiled: February 15, 2010Date of Patent: March 4, 2014Assignee: Microsoft CorporationInventors: Marc A. Najork, Sreenivas Gollapudi, Rina Panigrahy, Atish Das Sarma
-
Patent number: 8612432Abstract: A tree structure has a node associated with each category of a hierarchy of item categories. Child nodes of the tree are associated with sub-categories of the categories associated with parent nodes. Training data including received queries and indicators of a selected item category for each received query is combined with the tree structure by associating each query with the node corresponding to the selected category of the query. When a query is received, a classifier is applied to the nodes to generate a probability that the query is intended to match an item of the category associated with the node. The classifier is applied until the probability is below a threshold. One or more categories associated with the nodes that are closest to the intent of the received query are selected and indicators of items of those categories that match the received query are output.Type: GrantFiled: June 16, 2010Date of Patent: December 17, 2013Assignee: Microsoft CorporationInventors: Krishnaram N. G. Kenthapadi, Panayiotis Tsaparas, Sreenivas Gollapudi, Rakesh Agrawal
-
Patent number: 8583667Abstract: As provided herein, a pairwise distance between nodes in a large graph can be determined efficiently. URL-sketches are generated for respective nodes in an index by extracting labels from respective nodes, which provide a reference to a link between the nodes, aggregating the labels into sets for respective nodes, and storing the sets of labels as URL-sketches. Neighborhood-sketches are generated for the respective nodes in the index using the URL-sketches, by determining a neighborhood for a node and generating a sketch using labels that are associated with the respective neighboring nodes. A distance between two nodes is determined by computing an approximate number of paths and an approximate path length between the two nodes, using the neighborhood sketches for the two nodes.Type: GrantFiled: December 8, 2011Date of Patent: November 12, 2013Assignee: Microsoft CorporationInventor: Sreenivas Gollapudi
-
Publication number: 20130226713Abstract: Advertisers provide bids for the placement of one or more advertisements on web pages, along with a set of externalities. The externalities from an advertiser indicate discounts that can be applied to their bid based on information learned from a browse history of a user. The externalities may include externalities based on previous viewings of advertisements from the advertiser by the user, externalities based on previous viewings of advertisements from competitor advertisers viewed by the user, and externalities based on web pages or domains that have been visited by the user. When a request for an advertisement is received, the externalities are used to discount the provided bids based on the browse history of the user. An advertisement is then selected based on the discounted bids.Type: ApplicationFiled: February 28, 2012Publication date: August 29, 2013Applicant: Microsoft CorporationInventors: Sreenivas Gollapudi, Anand Bhalgat
-
Patent number: 8458130Abstract: Documents are replicated among servers comprising a search engine based on the value of each document by approximating its value as one of the top search results for one or more exemplary queries. Documents are allocated among servers comprising a search engine by calculating a relevance value for each document and then distributing the documents evenly to the servers. A subset of servers are selected from among a plurality of servers comprising a search engine using term-based, server-specific histograms reflecting the number of instances of the term in each document allocated to each server, and then selecting servers to service a query based on the documents on those servers.Type: GrantFiled: March 3, 2011Date of Patent: June 4, 2013Assignee: Microsoft CorporationInventors: Krishnaram N. G. Kenthapadi, Shuai Ding, Sreenivas Gollapudi, Samuel Ieong, Alexandros Ntoulas
-
Publication number: 20120276992Abstract: A gaming environment is provided by an MVP gaming system provider in which “most valuable player” (MVP) gamers may compete. MVP gamers may be identified using achievements, gamer scores, game play during sanctioned gaming events, or other indicia of game skills. The MVP gamers may be sponsored by advertisers, and the MVP gamers' avatars may be branded based on sponsorship during gaming events. The sponsorships may be brokered by the MVP gaming system provider. Some gaming events may be sanctioned gaming events that are coordinated by the MVP gaming system provider and “televised” to allow viewers to watch the gaming events. Tutorials from MVP gamers may also be provided to gamers for viewing to assist in their game play. Further, gamers may be able to rent the avatars of MVP gamers for use during their game play.Type: ApplicationFiled: April 27, 2011Publication date: November 1, 2012Applicant: MICROSOFT CORPORATIONInventors: MOHAMMED MOINUDDIN, JOSEPH FUTTY, DAN E. WALTHER, SREENIVAS GOLLAPUDI, DANNY LANGE, SRIPRIYA PRASHANTHI VASUDEVAN, MILLER THOMAS ABEL, STELIOS PAPARIZOS, JOHN C. SHAFER
-
Publication number: 20120278154Abstract: An inventory marketing system operates to identify and market inventory items that are likely to spoil. Initially, inventory items that have a particular likelihood of spoilage may be identified. Customers to target with offers for the inventory items may be identified based on the customers' current location or expected location near a spoilage time for the inventory items. Offers for the inventory items may be provided to the targeted customers, and purchases of the inventory items by customers may be facilitated.Type: ApplicationFiled: April 28, 2011Publication date: November 1, 2012Applicant: MICROSOFT CORPORATIONInventors: DANNY LANGE, MILLER THOMAS ABEL, MATTHEW GRAHAM DYOR, JOHN C. SHAFER, STELIOS PAPARIZOS, JOSEPH FUTTY, SREENIVAS GOLLAPUDI
-
Publication number: 20120277004Abstract: An achievement system tracks users' offline activities and awards achievements to users for participation in particular offline activities. The achievements that are awarded for particular activities and/or to particular users may be sponsored by merchants, who may compensate an achievement system provider for the opportunity to sponsor the achievements. To award users achievements, the users' offline activities are tracked. When a user participates in an offline activity for which achievements are available, the user is awarded an achievement. The achievement may be stored in an achievement profile for the user. In some embodiments, achievements earned by users may be converted into other benefits and alternative awards.Type: ApplicationFiled: April 27, 2011Publication date: November 1, 2012Applicant: MICROSOFT CORPORATIONInventors: MOHAMMED MOINUDDIN, JOSEPH FUTTY, MATTHEW GRAHAM DYOR, DAN E. WALTHER, SREENIVAS GOLLAPUDI, STELIOS PAPARIZOS, JOHN C. SHAFER
-
Publication number: 20120226679Abstract: 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: ApplicationFiled: March 2, 2011Publication date: September 6, 2012Applicant: Microsoft CorporationInventors: Sreenivas Gollapudi, Sayan Bhattacharya
-
Publication number: 20120226661Abstract: Documents are replicated among servers comprising a search engine based on the value of each document by approximating its value as one of the top search results for one or more exemplary queries. Documents are allocated among servers comprising a search engine by calculating a relevance value for each document and then distributing the documents evenly to the servers. A subset of servers are selected from among a plurality of servers comprising a search engine using term-based, server-specific histograms reflecting the number of instances of the term in each document allocated to each server, and then selecting servers to service a query based on the documents on those servers.Type: ApplicationFiled: March 3, 2011Publication date: September 6, 2012Applicant: Microsoft CorporationInventors: Krishnaram N. G. Kenthapadi, Shuai Ding, Sreenivas Gollapudi, Samuel Ieong, Alexandros Ntoulas
-
Patent number: 8255397Abstract: A first embodiment of the invention provides a system that automatically classifies documents in a collection into clusters based on the similarities between documents, that automatically classifies new documents into the right clusters, and that may change the number or parameters of clusters under various circumstances. A second embodiment of the invention provides a technique for comparing two documents, in which a fingerprint or sketch of each document is computed. In particular, this embodiment of the invention uses a specific algorithm to compute the document's fingerprint. One embodiment uses a sentence in the document as a logical delimiter or window from which significant words are extracted and, thereafter, a hash is computed of all pair-wise permutations. Words are extracted based on their weight in the document, which can be computed using measures such as term frequency and the inverse document frequency.Type: GrantFiled: August 26, 2008Date of Patent: August 28, 2012Assignee: EbraryInventor: Sreenivas Gollapudi
-
Patent number: 8250092Abstract: Methods, apparatus, and systems directed to receiving search queries, retrieving documents, computing the number of categories to present for a given query, computing the number of results to show in each category, computing an ordering of categories, and for all the result pages beyond the first page employing user interface elements that optionally allow the user to quickly zoom in on a specific category and get more results belonging to that category.Type: GrantFiled: December 19, 2011Date of Patent: August 21, 2012Assignee: Microsoft CorporationInventors: Sreenivas Gollapudi, Rakesh Agrawal, Samuel Ieong
-
Publication number: 20120124070Abstract: A set of queries, such as a search log, is divided into commercial queries and non-commercial queries. A first set of query communities is determined from the non-commercial queries and a second set is determined from the commercial queries. The query communities are correlated based on the users who submitted the queries and instances where a query from the first set of query communities was followed by a query from the second set to generate a mapping between the first set of query communities and the second set. Later, a non-commercial query is received from a user, and the mapping is used to predict one or more commercial queries that the user is likely to submit in the future based on the non-commercial query. One or more of the commercial queries are presented to the user according to the mapping with search results responsive to the non-commercial query.Type: ApplicationFiled: November 11, 2010Publication date: May 17, 2012Applicant: Microsoft CorporationInventors: Nina Mishra, Sreenivas Gollapudi, Srikanth Jagabathula
-
Publication number: 20120089588Abstract: Methods, apparatus, and systems directed to receiving search queries, retrieving documents, computing the number of categories to present for a given query, computing the number of results to show in each category, computing an ordering of categories, and for all the result pages beyond the first page employing user interface elements that optionally allow the user to quickly zoom in on a specific category and get more results belonging to that category.Type: ApplicationFiled: December 19, 2011Publication date: April 12, 2012Applicant: MICROSOFT CORPORATIONInventors: SREENIVAS GOLLAPUDI, RAKESH AGRAWAL, SAMUEL IEONG
-
Publication number: 20120078927Abstract: As provided herein, a pairwise distance between nodes in a large graph can be determined efficiently. URL-sketches are generated for respective nodes in an index by extracting labels from respective nodes, which provide a reference to a link between the nodes, aggregating the labels into sets for respective nodes, and storing the sets of labels as URL-sketches. Neighborhood-sketches are generated for the respective nodes in the index using the URL-sketches, by determining a neighborhood for a node and generating a sketch using labels that are associated with the respective neighboring nodes. A distance between two nodes is determined by computing an approximate number of paths and an approximate path length between the two nodes, using the neighborhood sketches for the two nodes.Type: ApplicationFiled: December 8, 2011Publication date: March 29, 2012Applicant: Microsoft CorporationInventor: Sreenivas Gollapudi
-
Patent number: 8139495Abstract: A method, computer-readable medium, and system for providing a quality measurement based on communications within a communication application. Communication attributes that include information associated with a user's communications are obtained. In embodiments, such communication attributes may pertain to communication duration and communication frequency. Upon obtaining communication attributes, a quality measurement may be determined based on the communication attributes. Such a quality measurement provides an indication of the quality of the user's communications. In embodiments, the quality measurement may be stored, communicated to a user, or implemented within a communication application.Type: GrantFiled: September 13, 2007Date of Patent: March 20, 2012Assignee: Microsoft CorporationInventors: Sreenivas Gollapudi, Alan D. Halverson, Krishnaram G. Kenthapadi
-
Patent number: 8103686Abstract: Large numbers of lists of entities may be mined for similar entities to related searches. A representation for each list may be determined to provide for a comparison between lists and to support membership checks. A score for an element in a list may be computed that represents the validity of an item in the corpus of lists. Thus, a spurious element would receive a very low score, where a valid element would receive a higher score. A list weight is then computed using the constituent element weights, and the element and list weight are used to compute the nearest neighbors of a given query element.Type: GrantFiled: December 12, 2007Date of Patent: January 24, 2012Assignee: Microsoft CorporationInventors: Sreenivas Gollapudi, Alan Halverson
-
Patent number: 8099417Abstract: Relevant search results for a given query may be determined using click data for the query and the number of times the query is issued to a search engine. The number of clicks that a result receives for the given query may provide a feedback mechanism to the search engine on how relevant the result is for the given query. The frequency of a query along with the associated clicks provides the search engine with the effectiveness of the query in producing relevant results. Edges in a graph of queries versus results may be weighted in accordance with the click data and the efficiency to rank the search results provided to a user.Type: GrantFiled: December 12, 2007Date of Patent: January 17, 2012Assignee: Microsoft CorporationInventors: Sreenivas Gollapudi, Rina Panigrahy
-
Patent number: 8090729Abstract: As provided herein, a pairwise distance between nodes in a large graph can be determined efficiently. URL-sketches are generated for respective nodes in an index by extracting labels from respective nodes, which provide a reference to a link between the nodes, aggregating the labels into sets for respective nodes, and storing the sets of labels as URL-sketches. Neighborhood-sketches are generated for the respective nodes in the index using the URL-sketches, by determining a neighborhood for a node and generating a sketch using labels that are associated with the respective neighboring nodes. A distance between two nodes is determined by computing an approximate number of paths and an approximate path length between the two nodes, using the neighborhood sketches for the two nodes.Type: GrantFiled: March 3, 2009Date of Patent: January 3, 2012Assignee: Microsoft CorporationInventor: Sreenivas Gollapudi