Patents by Inventor Daniel Delling

Daniel Delling 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: 11393083
    Abstract: The present disclosure relates to a process and a system for assessing the performance of cleaning operations by utilizing an automatic read out routine for test strips subjected to a cleaning operation. Furthermore, the present disclosure relates to a computer program product capable of performing the process.
    Type: Grant
    Filed: August 7, 2020
    Date of Patent: July 19, 2022
    Assignee: Ecolab USA Inc.
    Inventors: Jan Sanders, Fernanda Furtado de Melo Albino, Sabine Swoboda, Sebastian Niebur, Nadine Göhring, Ann Mangskau, Carola Stingl, Daniel D. Anderson, Florian M. Witt, Christian Lührs, Andreas Krohn, Marc Delling
  • Patent number: 10366413
    Abstract: Aspects of the subject disclosure are directed towards managing sponsored online content based upon advertiser behavior. Defining mini-markets to represent such advertiser behavior may be accomplished by clustering queries that generate revenue from one or more campaigns. Query revenue data between queries and a set of campaigns may be used to determine such mini-markets. To illustrate, a query whose highest revenue is attributed to a campaign may be selected for that campaign's mini-market. When that query is entered as a search term, the campaign's mini-market helps allocate space for advertisements.
    Type: Grant
    Filed: June 25, 2013
    Date of Patent: July 30, 2019
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Yunhong Zhou, Christopher J Leggetter, Naiping Liu, Daniel Delling, Xiang Zhao, Xia Sharon Wan, Andrew Goldberg, Renato F. Werneck, Darshan Vishwanath Kantak
  • Patent number: 10115115
    Abstract: One or more all-distances sketches are generated for nodes in a graph. An all-distances sketch for a node includes a subset of the nodes of the graph, and a shortest distance between the node and each of the nodes in the subset of nodes. The generated all-distances sketches are used to estimate the closeness similarity of nodes. The estimated closeness similarity can be used for targeted advertising or for content item recommendation, for example.
    Type: Grant
    Filed: September 16, 2014
    Date of Patent: October 30, 2018
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Renato F. Werneck, Moises Goldszmidt, Andrew V. Goldberg, Edith Cohen, Daniel Delling, Fabian Fuchs
  • Patent number: 10060753
    Abstract: Computing shortcuts for cells used in cell-based routing in a mobile navigation system re-computes shortcuts based on updated traffic conditions and estimated time of arrival (ETA) at an entry to the cell. Shortcuts are computed on demand and stored in a last recently used (LRU) cache. Shortcuts are computed using cost functions stored in the LRU cache. Shortcuts are computed in accordance with metadata stored in the LRU cache. Shortcuts are optionally based on predicted ETA and future traffic conditions to provide accurate estimates of best cost routes.
    Type: Grant
    Filed: August 17, 2016
    Date of Patent: August 28, 2018
    Assignee: Apple Inc.
    Inventors: Daniel Delling, Dennis Schieferdecker, Christian Sommer
  • Patent number: 10062188
    Abstract: Customizable route planning is a technique for computing point-to-point shortest paths in road networks. It includes three phases: preprocessing, metric customization, and queries. A graphics processing unit may be used, e.g., in the metric customization phase, to make customization even faster, enabling a wide range of applications including highly dynamic applications and on-line personalized cost functions.
    Type: Grant
    Filed: June 5, 2014
    Date of Patent: August 28, 2018
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Daniel Delling, Renato F. Werneck, Moritz Helge Kobitzsch
  • Patent number: 10018476
    Abstract: Live traffic routing in a mobile navigation system generates alternate routes based on the user's current location, live traffic conditions and estimated time of arrival at certain locations along the route. Live traffic routing re-ranks alternate routes taking into account which routes offer the best cost path to the user's destination.
    Type: Grant
    Filed: August 17, 2016
    Date of Patent: July 10, 2018
    Assignee: Apple Inc.
    Inventors: Daniel Delling, Supratik Maitra, Dennis Schieferdecker, Christian Sommer
  • Publication number: 20180051995
    Abstract: Computing shortcuts for cells used in cell-based routing in a mobile navigation system re-computes shortcuts based on updated traffic conditions and estimated time of arrival (ETA) at an entry to the cell. Shortcuts are computed on demand and stored in a last recently used (LRU) cache. Shortcuts are computed using cost functions stored in the LRU cache. Shortcuts are computed in accordance with metadata stored in the LRU cache. Shortcuts are optionally based on predicted ETA and future traffic conditions to provide accurate estimates of best cost routes.
    Type: Application
    Filed: August 17, 2016
    Publication date: February 22, 2018
    Inventors: Daniel Delling, Dennis SCHIEFERDECKER, Christian SOMMER
  • Publication number: 20180052002
    Abstract: Live traffic routing in a mobile navigation system generates alternate routes based on the user's current location, live traffic conditions and estimated time of arrival at certain locations along the route. Live traffic routing re-ranks alternate routes taking into account which routes offer the best cost path to the user's destination.
    Type: Application
    Filed: August 17, 2016
    Publication date: February 22, 2018
    Inventors: Daniel Delling, Supratik MAITRA, Dennis SCHIEFERDECKER, Christian SOMMER
  • Patent number: 9612128
    Abstract: One or more techniques and/or systems are provided for controlling a travel route planning module associated with a user device. Travel related data, for a user and regarding previously traveled routes by the user, may be indicative of user travel preferences and/or behaviors. The travel related data is evaluated against computed routes derived from different weighting values applied to travel metrics (e.g., a cost associated with a U-turn, a highway, an industrial zone, etc.). For example, weighting values may be iteratively adjusted to generate a plurality of modified computed routes that may be evaluated to identify a target computed route having a similarity to a previously traveled route of the user above a threshold. User preference weighted travel metrics, generated based upon weighted travel metrics of the target computed route, are used to control a travel route planning module to generate a customized travel route for the user.
    Type: Grant
    Filed: April 29, 2015
    Date of Patent: April 4, 2017
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Daniel Delling, Moises Goldszmidt, Andrew V. Goldberg, John Krumm, Renato Fonseca Furquim Werneck
  • 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
  • Publication number: 20160320200
    Abstract: One or more techniques and/or systems are provided for controlling a travel route planning module associated with a user device. Travel related data, for a user and regarding previously traveled routes by the user, may be indicative of user travel preferences and/or behaviors. The travel related data is evaluated against computed routes derived from different weighting values applied to travel metrics (e.g., a cost associated with a U-turn, a highway, an industrial zone, etc.). For example, weighting values may be iteratively adjusted to generate a plurality of modified computed routes that may be evaluated to identify a target computed route having a similarity to a previously traveled route of the user above a threshold. User preference weighted travel metrics, generated based upon weighted travel metrics of the target computed route, are used to control a travel route planning module to generate a customized travel route for the user.
    Type: Application
    Filed: April 29, 2015
    Publication date: November 3, 2016
    Inventors: Daniel Delling, Moises Goldszmidt, Andrew V. Goldberg, John Krumm, Renato Fonseca Furquim Werneck
  • 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: 20160078148
    Abstract: One or more all-distances sketches are generated for nodes in a graph. An all-distances sketch for a node includes a subset of the nodes of the graph, and a shortest distance between the node and each of the nodes in the subset of nodes. The generated all-distances sketches are used to estimate the closeness similarity of nodes. The estimated closeness similarity can be used for targeted advertising or for content item recommendation, for example.
    Type: Application
    Filed: September 16, 2014
    Publication date: March 17, 2016
    Inventors: Renato F. Werneck, Moises Goldszmidt, Andrew V. Goldberg, Edith Cohen, Daniel Delling, Fabian Fuchs
  • Patent number: 9222791
    Abstract: A point-to-point shortest path technique supports real-time queries and fast metric update or replacement (metric customization). Determining a shortest path between two locations uses three stages: a preprocessing stage, a metric customization stage, and a query stage. Extensions to the customizable route planning (CRP) technique for routing are provided. These extensions include, for example, the computation of alternative routes, faster techniques for unpacking shortcuts, efficient query techniques for batched shortest path (one-to-many, many-to-many, and points of interest) determinations, and determining routes and alternative routes using traffic information.
    Type: Grant
    Filed: October 11, 2012
    Date of Patent: December 29, 2015
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC
    Inventors: Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
  • Publication number: 20150356759
    Abstract: Customizable route planning is a technique for computing point-to-point shortest paths in road networks. It includes three phases: preprocessing, metric customization, and queries. A graphics processing unit may be used, e.g., in the metric customization phase, to make customization even faster, enabling a wide range of applications including highly dynamic applications and on-line personalized cost functions.
    Type: Application
    Filed: June 5, 2014
    Publication date: December 10, 2015
    Inventors: Daniel Delling, Renato F. Werneck, Moritz Helge Korbitzsch
  • 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
  • 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
  • Patent number: 9170846
    Abstract: A distributed data-parallel execution (DDPE) system splits a computational problem into a plurality of sub-problems using a branch-and-bound algorithm, designates a synchronous stop time for a “plurality of processors” (for example, a cluster) for each round of execution, processes the search tree by recursively using a branch-and-bound algorithm in multiple rounds (without inter-processor communications), determines if further processing is required based on the processing round state data, and terminates processing on the processors when processing is completed.
    Type: Grant
    Filed: March 29, 2011
    Date of Patent: October 27, 2015
    Inventors: Daniel Delling, Mihai Budiu, Renato F. Werneck
  • Publication number: 20140379473
    Abstract: Aspects of the subject disclosure are directed towards managing sponsored online content based upon advertiser behavior. Defining mini-markets to represent such advertiser behavior may be accomplished by clustering queries that generate revenue from one or more campaigns. Query revenue data between queries and a set of campaigns may be used to determine such mini-markets. To illustrate, a query whose highest revenue is attributed to a campaign may be selected for that campaign's mini-market. When that query is entered as a search term, the campaign's mini-market helps allocate space for advertisements.
    Type: Application
    Filed: June 25, 2013
    Publication date: December 25, 2014
    Inventors: Yunhong Zhou, Christopher J. Leggetter, Naiping Liu, Daniel Delling, Xiang Zhao, Xia Sharon Wan, Andrew Goldberg, Renato F. Werneck, Darshan Vishwanath Kantak