Skip to main content

4 Result(s)

within Priti Shankar Remove this filter Algorithm Analysis and Problem Complexity Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Algebraic Structure Theory of Tail-Biting Trellises

    It is well known that there is an intimate connection between algebraic descriptions of linear block codes in the form of generator or parity-check matrices, and combinatorial descriptions in the form of trell...

    Priti Shankar in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (2007)

  2. No Access

    Chapter and Conference Paper

    Compressing XML Documents Using Recursive Finite State Automata

    We propose a scheme for automatically generating compressors for XML documents from Document Type Definition(DTD) specifications. Our algorithm is a lossless adaptive algorithm where the model used for compres...

    Hariharan Subramanian, Priti Shankar in Implementation and Application of Automata (2006)

  3. No Access

    Chapter and Conference Paper

    Integrating a New Cluster Assignment and Scheduling Algorithm into an Experimental Retargetable Code Generation Framework

    This paper presents a new unified algorithm for cluster assignment and region scheduling, and its integration into an experimental retargetable code generation framework. The components of the framework are an...

    K. Vasanta Lakshmi, Deepak Sreedhar… in High Performance Computing – HiPC 2005 (2005)

  4. No Access

    Chapter and Conference Paper

    A Package for the Implementation of Block Codes as Finite Automata

    We have implemented a package that transforms concise algebraic descriptions of linear block codes into finite automata representations, and also generates decoders from such representations. The transformatio...

    Priti Shankar, K. Sasidharan, Vikas Aggarwal… in Implementation and Application of Automata (2001)