Patents by Inventor David E. BIESENBACH

David E. BIESENBACH 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).

  • Name search using multiple bitmap distributions
    Patent number: 9020911
    Abstract: Provided are a computer implemented method, computer program product, and system for matching names. For a first bitmap distribution, it is determined whether a first bitmap signature of a query name and a second bitmap signature of a target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a first preliminary value. For a second bitmap distribution that is different from the first bitmap distribution, it is determined whether a third bitmap signature of the query name and a fourth bitmap signature of the target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a second preliminary value. The first preliminary value and the second preliminary value are combined, and, if the combination results in a value of true, it is determined that the query name and the target name are to be further processed.
    Type: Grant
    Filed: January 18, 2012
    Date of Patent: April 28, 2015
    Assignee: International Business Machines Corporation
    Inventors: David E. Biesenbach, Steven J. Liddle, Stephen J. Watjen, Charles K. Williams
  • Name search using multiple bitmap distributions
    Patent number: 9015132
    Abstract: Provided are techniques for matching names. For a first bitmap distribution, it is determined whether a first bitmap signature of a query name and a second bitmap signature of a target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a first preliminary value. For a second bitmap distribution that is different from the first bitmap distribution, it is determined whether a third bitmap signature of the query name and a fourth bitmap signature of the target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a second preliminary value. The first preliminary value and the second preliminary value are combined, and, if the combination results in a value of true, it is determined that the query name and the target name are to be further processed.
    Type: Grant
    Filed: April 12, 2012
    Date of Patent: April 21, 2015
    Assignee: International Business Machines Corporation
    Inventors: David E. Biesenbach, Steven J. Liddle, Stephen J. Watjen, Charles K. Williams
  • NAME SEARCH USING MULTIPLE BITMAP DISTRIBUTIONS
    Publication number: 20130185327
    Abstract: Provided are techniques for matching names. For a first bitmap distribution, it is determined whether a first bitmap signature of a query name and a second bitmap signature of a target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a first preliminary value. For a second bitmap distribution that is different from the first bitmap distribution, it is determined whether a third bitmap signature of the query name and a fourth bitmap signature of the target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a second preliminary value. The first preliminary value and the second preliminary value are combined, and, if the combination results in a value of true, it is determined that the query name and the target name are to be further processed.
    Type: Application
    Filed: April 12, 2012
    Publication date: July 18, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: David E. BIESENBACH, Steven J. LIDDLE, Stephen J. WATJEN, Charles K. WILLIAMS
  • NAME SEARCH USING MULTIPLE BITMAP DISTRIBUTIONS
    Publication number: 20130185326
    Abstract: Provided are a computer implemented method, computer program product, and system for matching names. For a first bitmap distribution, it is determined whether a first bitmap signature of a query name and a second bitmap signature of a target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a first preliminary value. For a second bitmap distribution that is different from the first bitmap distribution, it is determined whether a third bitmap signature of the query name and a fourth bitmap signature of the target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a second preliminary value. The first preliminary value and the second preliminary value are combined, and, if the combination results in a value of true, it is determined that the query name and the target name are to be further processed.
    Type: Application
    Filed: January 18, 2012
    Publication date: July 18, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: David E. BIESENBACH, Steven J. LIDDLE, Stephen J. WATJEN, Charles K. WILLIAMS