Patents by Inventor Hugh Lynch

Hugh Lynch 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).

  • Efficient similarity ranking for bipartite graphs
    Patent number: 10152557
    Abstract: Systems and methods offer an efficient approach to computing similarity rankings in bipartite graphs. An example system includes at least one processor and memory storing a bipartite graph having a first set and a second set of nodes, with nodes in the first set being connected to nodes in the second set by edges. The memory also stores instructions that, when executed by the at least one processor, cause the system to assign each node in the second set to one of a plurality of categories and, for each of the plurality of categories, generate a subgraph. The subgraph comprises of a subset of nodes in the first set and edges linking the nodes in the subset, where the nodes in the subset are selected based on connection to a node in the second set that is assigned to the category. The system uses the subgraph to respond to queries.
    Type: Grant
    Filed: May 15, 2014
    Date of Patent: December 11, 2018
    Assignee: Google LLC
    Inventors: Seyed Vahab Mirrokni Banadaki, Silvio Lattanzi, Jonathan Ezra Feldman, Alessandro Epasto, Stefano Leonardi, Hugh Lynch, Varun Sharma
  • EFFICIENT SIMILARITY RANKING FOR BIPARTITE GRAPHS
    Publication number: 20150220530
    Abstract: Systems and methods offer an efficient approach to computing similarity rankings in bipartite graphs. An example system includes at least one processor and memory storing a bipartite graph having a first set and a second set of nodes, with nodes in the first set being connected to nodes in the second set by edges. The memory also stores instructions that, when executed by the at least one processor, cause the system to assign each node in the second set to one of a plurality of categories and, for each of the plurality of categories, generate a subgraph. The subgraph comprises of a subset of nodes in the first set and edges linking the nodes in the subset, where the nodes in the subset are selected based on connection to a node in the second set that is assigned to the category. The system uses the subgraph to respond to queries.
    Type: Application
    Filed: May 15, 2014
    Publication date: August 6, 2015
    Applicant: GOOGLE INC.
    Inventors: Seyed Vahab Mirrokni Banadaki, Silvio Lattanzi, Jonathan Ezra Feldman, Alessandro Epasto, Stefano Leonardi, Hugh Lynch, Varun Sharma