Patents by Inventor Thomas Dee McGuire

Thomas Dee McGuire 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).

  • Method and system for selecting grammar symbols for variable length data compressors
    Patent number: 7126500
    Abstract: A data compression method and system replaces pairs of symbols in a string of symbols by a single new symbol. A method for selecting the pairs of symbols to be replaced employs a modified greedy algorithm. The method selects a next best pair of symbols for replacement by considering pairs that have a potential for usurping a current best candidate pair of symbols, due to their frequency of occurrence. A minimum savings threshold is evaluated to further avoid exhaustive searches of all possible pairs of symbols.
    Type: Grant
    Filed: June 26, 2002
    Date of Patent: October 24, 2006
    Assignee: Microsoft Corporation
    Inventors: Stephen Robert Adams, Thomas Dee McGuire
  • Method and system for compressing and decompressing multiple independent blocks
    Patent number: 6700513
    Abstract: A system and method that provides a unique or custom context for a plurality of blocks of data, yet compresses the blocks independently from the others, such that each block is independently decompressible. The method analyzes a collection of blocks for compression, and computes a unique context, such as a Huffman tree, given the distribution of symbols or phrases across all the blocks in the collection. Each block in the collection can be independently decompressed, in any order, using the shared context that is common to the collection.
    Type: Grant
    Filed: May 14, 2002
    Date of Patent: March 2, 2004
    Assignee: Microsoft Corporation
    Inventor: Thomas Dee McGuire
  • Method and system for selecting grammar symbols for variable length data compressors
    Publication number: 20040001543
    Abstract: A data compression method and system replaces pairs of symbols in a string of symbols by a single new symbol. A method for selecting the pairs of symbols to be replaced employs a modified greedy algorithm. The method selects a next best pair of symbols for replacement by considering pairs that have a potential for usurping a current best candidate pair of symbols, due to their frequency of occurrence. A minimum savings threshold is evaluated to further avoid exhaustive searches of all possible pairs of symbols.
    Type: Application
    Filed: June 26, 2002
    Publication date: January 1, 2004
    Applicant: Microsoft Corporation
    Inventors: Stephen Robert Adams, Thomas Dee McGuire
  • METHOD AND SYSTEM FOR COMPRESSING AND DECOMPRESSING MULTIPLE INDEPENDENT BLOCKS
    Publication number: 20030218554
    Abstract: A system and method that provides a unique or custom context for a plurality of blocks of data, yet compresses the blocks independently from the others, such that each block is independently decompressible. The method analyzes a collection of blocks for compression, and computes a unique context, such as a Huffman tree, given the distribution of symbols or phrases across all the blocks in the collection. Each block in the collection can be independently decompressed, in any order, using the shared context that is common to the collection.
    Type: Application
    Filed: May 14, 2002
    Publication date: November 27, 2003
    Applicant: Microsoft Corporation
    Inventor: Thomas Dee McGuire