Patents by Inventor Laxmi Parida

Laxmi Parida 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).

  • Publication number: 20050076026
    Abstract: Given an input sequence of data, a rigid pattern is a repeating sequence, possibly interspersed with don't-care characters. The data can be a sequence of characters or sets of characters or even real values. In practice, the patterns or motifs of interest are the ones that also allow a variable number of gaps (or don't-care characters): these are patterns with spacers termed extensible patterns. In a bioinformatics context, similar patterns have also been called flexible patterns or motifs. A system according to the invention discovers all the maximal extensible motifs in the input. The flexibility is succinctly defined by a single integer parameter D?1 which is interpreted as the allowable space to be between 1 and D characters between two successive solid characters in a reported motif.
    Type: Application
    Filed: October 1, 2003
    Publication date: April 7, 2005
    Inventor: Laxmi Parida
  • Publication number: 20050071334
    Abstract: Classification of objects using the best boolean expression that represents the most optimal combination of the underlying features is disclosed.
    Type: Application
    Filed: September 30, 2003
    Publication date: March 31, 2005
    Applicant: IBM Corporation
    Inventors: Laxmi Parida, Ajay Royyuru
  • Publication number: 20050060321
    Abstract: A new portion of an input string is selected. The input string has a number of characters from an alphabet. The new portion differs from a previously selected portion of the input string by one or more new characters of the input string. One or more values are determined for how many of the one or more new characters are in the portion of the input string. It is determined which, if any, names in a number of sets of names have changed by selection of the new portion. The number of sets have a first set and a number of additional sets, wherein the first set corresponds to all of the characters in the alphabet and to values of how many of the characters of the alphabet are in the previously selected portion. The values are names for the first set. Each additional set comprises names corresponding to selected pairs of names from a single other set. Changes in the names are used to determine the permutation patterns.
    Type: Application
    Filed: September 12, 2003
    Publication date: March 17, 2005
    Applicant: International Business Machines Corporation
    Inventors: Laxmi Parida, Revital Erez, Menachem Landau
  • Publication number: 20050025232
    Abstract: An apparatus for data compression includes an identifier which identifies a plurality of irredundant patterns in a data set, and an extractor which extracts at least a portion of the plurality of irredundant patterns from the data set to generate a compressed data set.
    Type: Application
    Filed: July 28, 2003
    Publication date: February 3, 2005
    Applicant: International Business Machines Corporation
    Inventors: Laxmi Parida, Alberto Apostolico