Patents by Inventor David Agraz

David Agraz 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: 10133809
    Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for ranking search results. One of the methods includes identifying one or more sessions for a query and associating watch times of the respective resources watched in the sessions with the query. One or more watch time signals are calculated for a first resource and the query based on the watch times associated with the query. A first search result responsive to the query is obtained, wherein the first search result identifies the first resource and has an associated score S. A new score S? is calculated based on a least S and a watch time function, the watch time function being a function of the one or more watch time signals. The new score S? is provided to a process for ranking search results including the first search result.
    Type: Grant
    Filed: June 29, 2015
    Date of Patent: November 20, 2018
    Assignee: Google LLC
    Inventors: James Lawry, Bryan M. Kressler, Stanislav Plamenov Angelov, David Kliger Elson, Christian Kaiserlian, David Agraz, Jeremy Hylton, Phong Thanh Pham
  • Patent number: 9098511
    Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for ranking search results. One of the methods includes identifying one or more sessions for a query and associating watch times of the respective resources watched in the sessions with the query. One or more watch time signals are calculated for a first resource and the query based on the watch times associated with the query. A first search result responsive to the query is obtained, wherein the first search result identifies the first resource and has an associated score S. A new score S? is calculated based on a least S and a watch time function, the watch time function being a function of the one or more watch time signals. The new score S? is provided to a process for ranking search results including the first search result.
    Type: Grant
    Filed: March 6, 2013
    Date of Patent: August 4, 2015
    Assignee: Google Inc.
    Inventors: James Lawry, Bryan M. Kressler, Stanislav Plamenov Angelov, David Elson, Christian Kaiserlian, David Agraz, Jeremy Hylton, Phong Thanh Pham
  • Patent number: 7065586
    Abstract: A system and method for scheduling transfers of data through a network, the system comprising a transfer module at each node in the network, the transfer module being configured to schedule data transfers according to available resources at each node. In one embodiment, the transfer module includes a scheduling module, a routing module, and an execution module. The scheduling module at each node evaluates a single hop request in view of objectives, such as a deadline, and the available resources at that node, for example transmit bandwidth, receive bandwidth, and storage space, all of which may change as a function of time.
    Type: Grant
    Filed: August 21, 2001
    Date of Patent: June 20, 2006
    Assignee: Radiance Technologies, Inc.
    Inventors: John C. Ruttenberg, Walter D. Lichtenstein, David Agraz, Fouad A. Tobagi, Ashfaq A. Munshi, David Lemke
  • Publication number: 20050188089
    Abstract: A methodology and algorithm for managing resources from classes within a pool of resources to determine whether and what resources may be allocated upon a request for resources.
    Type: Application
    Filed: February 24, 2004
    Publication date: August 25, 2005
    Inventors: Walter Lichtenstein, David Agraz, Luis Rojas, John Ruttenberg, Anders Skoe
  • Publication number: 20020083185
    Abstract: A system and method for scheduling transfers of data through a network, the system comprising a transfer module at each node in the network, the transfer module being configured to schedule data transfers according to available resources at each node. In one embodiment, the transfer module includes a scheduling module, a routing module, and an execution module. The scheduling module at each node evaluates a single hop request in view of objectives, such as a deadline, and the available resources at that node, for example transmit bandwidth, receive bandwidth, and storage space, all of which may change as a function of time.
    Type: Application
    Filed: August 21, 2001
    Publication date: June 27, 2002
    Inventors: John C. Ruttenberg, Walter D. Lichtenstein, David Agraz, Fouad A. Tobagi, Ashfaq A. Munshi, David Lemke