Patents by Inventor Jeffery Rex Westbrook

Jeffery Rex Westbrook 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).

  • Graph algorithm for common neighborhood analysis
    Patent number: 7269628
    Abstract: A system and method of determining a common neighborhood of users sharing a common activity from a plurality of users is provided. The system and method may be used to predict, for a user in the common neighborhood of users, a potential activity from the activities of at least one other user in the common neighborhood of users.
    Type: Grant
    Filed: December 23, 2003
    Date of Patent: September 11, 2007
    Assignee: AT&T Corp.
    Inventors: Adam Louis Buchsbaum, Raffaele Giancarlo, Jeffery Rex Westbrook
  • Graph algorithm for common neighborhood analysis
    Patent number: 7051074
    Abstract: A system and method of determining a common neighborhood of users sharing a common activity from a plurality of users is provided. The system and method may be used to predict, for a user in the common neighborhood of users, a potential activity from the activities of at least one other user in the common neighborhood of users.
    Type: Grant
    Filed: August 22, 2000
    Date of Patent: May 23, 2006
    Assignee: AT&T Corp.
    Inventors: Adam Louis Buchsbaum, Raffaele Giancarlo, Jeffery Rex Westbrook
  • Method and apparatus for generating deterministic approximate weighted finite-state automata
    Patent number: 6266634
    Abstract: An approximate weighted finite-state automaton can be constructed in place of a weighted finite-state automaton so long as the approximate weighted finite-state automaton maintains a sufficient portion of the original best strings in the weighted finite-state automaton and sufficiently few spurious strings are introduced into the approximate weighted finite-state automaton compared to the weighted finite-state automaton. An approximate weighted finite-state automaton can be created from a non-deterministic weighted finite-state automaton during determinization by discarding the requirement that old states be used in place of new states only when an old state is identical to a new state. Instead, in an approximate weighted finite-state automaton, old states will be used in place of new states when each of the remainders of the new state is sufficiently close to the corresponding remainder of the old state.
    Type: Grant
    Filed: March 23, 2000
    Date of Patent: July 24, 2001
    Assignee: AT&T Corporation
    Inventors: Adam Louis Buchsbaum, Raffaele Giancarlo, Jeffery Rex Westbrook
  • Method and apparatus for generating deterministic approximate weighted finite-state automata
    Patent number: 6073098
    Abstract: An approximate weighted finite-state automaton can be constructed in place of a weighted finite-state automaton so long as the approximate weighted finite-state automaton maintains a sufficient portion of the original best strings in the weighted finite-state automaton and sufficiently few spurious strings are introduced into the approximate weighted finite-state automaton compared to the weighted finite-state automaton. An approximate weighted finite-state automaton can be created from a non-deterministic weighted finite-state automaton during determinization by discarding the requirement that old states be used in place of new states only when an old state is identical to a new state. Instead, in an approximate weighted finite-state automaton, old states will be used in place of new states when each of the remainders of the new state is sufficiently close to the corresponding remainder of the old state. An error tolerance parameter .tau.
    Type: Grant
    Filed: November 21, 1997
    Date of Patent: June 6, 2000
    Assignee: AT&T Corporation
    Inventors: Adam Louis Buchsbaum, Raffaele Giancarlo, Jeffery Rex Westbrook