Patents by Inventor Bipin Suresh

Bipin Suresh 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).

  • Method for sharing and searching playlists
    Publication number: 20060195479
    Abstract: 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.
    Type: Application
    Filed: December 21, 2005
    Publication date: August 31, 2006
    Inventors: Michael Spiegelman, David Brown, Lori Sutton, Pierre Schiro, Christa Stelzmuller, Siddhartha Sahay, Daniel Baird, Adam Korman, Alexander Toth, Poorna Chandra Ramachandra, Bipin Suresh
  • User interface for sharing and searching playlists
    Publication number: 20060195480
    Abstract: The present disclosure provides a user interface for making a playlist available to the public. In another embodiment, the present disclosure provides a user interface for creating a playlist comprising user-defined descriptor information. In another embodiment, the present disclosure provides a user interface for searching for such public playlists.
    Type: Application
    Filed: December 21, 2005
    Publication date: August 31, 2006
    Inventors: Michael Spiegelman, David Brown, Lori Sutton, Pierre Schiro, Christa Stelzmuller, Siddhartha Sahay, Daniel Baird, Adam Korman, Alexander Toth, Poorna Chandra Gowda Ramachandra, Bipin Suresh
  • Method and system for finding related nodes in a social network
    Patent number: 7016307
    Abstract: 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.
    Type: Grant
    Filed: March 11, 2004
    Date of Patent: March 21, 2006
    Assignee: Yahoo! Inc.
    Inventors: Varun Vasudev, Bipin Suresh
  • Method and system for finding a friend in a social network
    Publication number: 20050201290
    Abstract: 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.
    Type: Application
    Filed: March 11, 2004
    Publication date: September 15, 2005
    Applicant: Yahoo! Inc.
    Inventors: Varun Vasudev, Bipin Suresh