Yahoo! Inc.

Huawei Technologies Co., Limited

Bipin Suresh

Michael Spiegelman

David E Brown

Pierre Schiro

Adam Korman

Daniel Baird

Alexander Stephen Toth

Christa Maria Stelzmuller

Poorna Chandra Gowda Bannikuppe Ramachandra

Siddhartha S Sahay

Lori Ann Sutton

Jignashu Parikh

Byron Edward Dom

Dmitry Pavlov

Ramnath Balasubramanyan

Varun Vasudev

Abhishek Goyal

Nikhil Garg

A method for making a playlist available to the public, in which the playlist comprises user-defined descriptor information. The user-defined descriptor information is entered as free form text or prose.

Method for sharing and searching playlists

The present disclosure provides a method for making a playlist available to the public. In another embodiment, the present disclosure provides a method for creating a playlist comprising user-defined descriptor information. In another embodiment, the present disclosure provides a method for searching for such public playlists.

Techniques are provided for designating an item as being of a particular type when the item has been selected after being returned in response to a search and by identifying which mode, of a plurality of modes, in which the search engine was operating when the item was selected.

Identifying offensive content using user click data

Techniques are provided for automatic product categorization. In one aspect, the categorization is based on text and one or more other values associated with a product offering. In another aspect, a first categorization of a product offering is performed and, if the product category chosen is in a set of co-refinable product categories, then a second (or third, fourth and so on) categorization is performed among the set of co-refinable product categories. In a third aspect, products are categorized based on cost. In another aspect, after products are categorized, the products are flagged for further categorization processing if the cost for categorizing the product is beyond a predefined threshold.

Automatic product categorization

Techniques are described herein for providing search results that are ranked based on a predictor that predicts, for each of a number of objects, likelihoods that each particular object will be selected at different positions on a results list.

Predicting and ranking search query results

A process for reducing the resources employed in real time to communicate a message between related nodes that are separated by multiple degrees of separation in a social network. At least a portion of the shortest path for the multiple degrees of separation between at least two related nodes in a social network is determined out of band prior to the initiation of a process to communicate between the related nodes. By pre-processing at least a portion of the degrees of separation for the shortest path between the nodes, the actual resources employed in real time to calculate the entire shortest path can be reduced. Typically, approximately fifty percent or more of the shortest paths for the degrees of separation between related nodes in the social network are pre-processed. Since the amount of resources for determining the shortest path for each degree of separation can exponentially increase with each degree, the pre-processing of a portion of the degrees of separation along a shortest path can significantly reduce the resources required in real time to complete the determination of the shortest path. Also, if a common intermediate node is identified in the pre-processing of the shortest paths for two nodes in the social network, the intermediate shortest paths can be stored for reuse as a complete shortest path between these two nodes.

Method and system for finding related nodes in a social network

Growing community of inventors

Bengaluru, India

Bipin Suresh