Patents by Inventor Jerry Yi Ding

Jerry Yi Ding 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).

  • Asynchronous message passing for large graph clustering
    Patent number: 9852230
    Abstract: Systems and methods for sending asynchronous messages include receiving, using at least one processor, at a node in a distributed graph, a message with a first value and determining, at the node, that the first value replaces a current value for the node. In response to determining that the first value replaces the current value, the method also includes setting a status of the node to active and sending messages including the first value to neighboring nodes. The method may also include receiving the messages to the neighboring nodes at a priority queue. The priority queue propagates messages in an intelligently asynchronous manner, and the priority queue propagates the messages to the neighboring nodes, the status of the node is set to inactive. The first value may be a cluster identifier or a shortest path identifier.
    Type: Grant
    Filed: December 31, 2013
    Date of Patent: December 26, 2017
    Assignee: Google LLC
    Inventors: Eduardo Madeira Fleury, Seyed Vahab Mirrokni Banadaki, Nissan Hajaj, Jerry Yi Ding, Silvio Lattanzi
  • ASYNCHRONOUS MESSAGE PASSING FOR LARGE GRAPH CLUSTERING
    Publication number: 20150006606
    Abstract: Systems and methods for sending asynchronous messages include receiving, using at least one processor, at a node in a distributed graph, a message with a first value and determining, at the node, that the first value replaces a current value for the node. In response to determining that the first value replaces the current value, the method also includes setting a status of the node to active and sending messages including the first value to neighboring nodes. The method may also include receiving the messages to the neighboring nodes at a priority queue. The priority queue propagates messages in an intelligently asynchronous manner, and the priority queue propagates the messages to the neighboring nodes, the status of the node is set to inactive. The first value may be a cluster identifier or a shortest path identifier.
    Type: Application
    Filed: December 31, 2013
    Publication date: January 1, 2015
    Applicant: GOOGLE INC.
    Inventors: Eduardo Madeira Fleury, Seyed Vahab Mirrokni Banadaki, Nissan Hajaj, Jerry Yi Ding, Silvio Lattanzi