Patents by Inventor Thomas Pajor

Thomas Pajor 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: 9576073
    Abstract: Distance query techniques are provided that are robust to network structure, scale to large and massive networks, and are fast, straightforward, and efficient. A hierarchical hub labeling (HHL) technique is described to determine a distance between two nodes or vertices on a network. The HHL technique provides indexing by ordering vertices by importance, then transforming the ordering into an index, which enables fast exact shortest-path distance queries. The index may be compressed without sacrificing its correctness.
    Type: Grant
    Filed: June 2, 2014
    Date of Patent: February 21, 2017
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC
    Inventors: Thomas Pajor, Daniel Delling, Renato F. Werneck, Andrew V. Goldberg
  • Publication number: 20160350382
    Abstract: A graph that includes multiple nodes and edges is received. Multiple instances of the graph are generated by randomly instantiating the edges according to either a binary independent cascade model or a randomized edge length independent cascade model. Where the binary independent cascade model is used, combined reachability sketches are generated for each node across all instances of the graph. Where the randomized edge length independent cascade model is used, combined all-distances sketches are generated for each node across all instances of the graph. Depending on which model is used, the combined reachability or all-distances sketches are used to estimate the influence of nodes in the graph or to estimate a subset of nodes from a graph of a specified size with a maximum influence using a greedy algorithm.
    Type: Application
    Filed: August 15, 2016
    Publication date: December 1, 2016
    Inventors: Renato F. Werneck, Daniel Delling, Thomas Pajor, Edith Cohen
  • Patent number: 9443034
    Abstract: A graph that includes multiple nodes and edges is received. Multiple instances of the graph are generated by randomly instantiating the edges according to either a binary independent cascade model or a randomized edge length independent cascade model. Where the binary independent cascade model is used, combined reachability sketches are generated for each node across all instances of the graph. Where the randomized edge length independent cascade model is used, combined all-distances sketches are generated for each node across all instances of the graph. Depending on which model is used, the combined reachability or all-distances sketches are used to estimate the influence of nodes in the graph or to estimate a subset of nodes from a graph of a specified size with a maximum influence using a greedy algorithm.
    Type: Grant
    Filed: May 29, 2014
    Date of Patent: September 13, 2016
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Renato F. Werneck, Daniel Delling, Thomas Pajor, Edith Cohen
  • Publication number: 20150347629
    Abstract: Distance query techniques are provided that are robust to network structure, scale to large and massive networks, and are fast, straightforward, and efficient. A hierarchical hub labeling (HHL) technique is described to determine a distance between two nodes or vertices on a network. The HHL technique provides indexing by ordering vertices by importance, then transforming the ordering into an index, which enables fast exact shortest-path distance queries. The index may be compressed without sacrificing its correctness.
    Type: Application
    Filed: June 2, 2014
    Publication date: December 3, 2015
    Applicant: Microsoft Corporation
    Inventors: Thomas Pajor, Daniel Delling, Renato F. Werneck, Andrew V. Goldberg
  • Publication number: 20150347625
    Abstract: A graph that includes multiple nodes and edges is received. Multiple instances of the graph are generated by randomly instantiating the edges according to either a binary independent cascade model or a randomized edge length independent cascade model. Where the binary independent cascade model is used, combined reachability sketches are generated for each node across all instances of the graph. Where the randomized edge length independent cascade model is used, combined all-distances sketches are generated for each node across all instances of the graph. Depending on which model is used, the combined reachability or all-distances sketches are used to estimate the influence of nodes in the graph or to estimate a subset of nodes from a graph of a specified size with a maximum influence using a greedy algorithm.
    Type: Application
    Filed: May 29, 2014
    Publication date: December 3, 2015
    Applicant: Microsoft Corporation
    Inventors: Renato F. Werneck, Daniel Delling, Thomas Pajor, Edith Cohen
  • Patent number: 8494771
    Abstract: Optimum journeys in public transportation networks are determined. The determination of Pareto optimal journeys from one stop to another stop in a public transportation network uses the criteria travel time and minimum transfers. A technique for bi-criteria journey planning using the aforementioned criteria in public transportation networks operates in rounds (K rounds at most), where after round k (k?K), arrival times are computed for the stops that can be reached with up to k trips.
    Type: Grant
    Filed: September 7, 2011
    Date of Patent: July 23, 2013
    Assignee: Microsoft Corporation
    Inventors: Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
  • Publication number: 20130060468
    Abstract: Optimum journeys in public transportation networks are determined. The determination of Pareto optimal journeys from one stop to another stop in a public transportation network uses the criteria travel time and minimum transfers. A technique for bi-criteria journey planning using the aforementioned criteria in public transportation networks operates in rounds (K rounds at most), where after round k (k?K), arrival times are computed for the stops that can be reached with up to k trips.
    Type: Application
    Filed: September 7, 2011
    Publication date: March 7, 2013
    Applicant: Microsoft Corporation
    Inventors: Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
  • Publication number: 20120310523
    Abstract: A point-to-point shortest path technique supports real-time queries and fast metric update or replacement (metric customization). Arbitrary metrics (cost functions) are supported without significant degradation in performance. Determining a shortest path between two locations uses three stages: a preprocessing stage, a metric customization stage, and a query stage. Preprocessing is based on a graph structure only, while metric customization augments preprocessing results taking edge costs into account. The preprocessing partitions the graph into loosely connected components of bounded size and creates an overlay graph by replacing each component with a “clique” connecting its boundary vertices. Clique edge lengths are computed during the customization phase. The customization phase can be repeated for various different metrics, and produces a small amount of data for each. The query phase is run using the metric-independent data together with the relevant metric-specific data.
    Type: Application
    Filed: June 3, 2011
    Publication date: December 6, 2012
    Applicant: Microsoft Corporation
    Inventors: Daniel Delling, Renato F. Wemeck, Andrew V. Goldberg, Thomas Pajor