Skip to main content

9 Result(s)

within Conference Paper Remove this filter Priti Shankar Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Deep Packet Inspection Using Message Passing Networks

    We propose a solution based on message passing bipartite networks, for deep packet inspection, which addresses both speed and memory issues, which are limiting factors in current solutions. We report on a prel...

    Divya Jain, K Vasanta Lakshmi, Priti Shankar in Recent Advances in Intrusion Detection (2008)

  2. No Access

    Chapter and Conference Paper

    Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA

    Context sensitive pointer analyses based on Whaley and Lam’s bddbddb system have been shown to scale to large Java programs. We provide a technique to incorporate flow sensitivity for Java fields into one such an...

    Prakash Prabhu, Priti Shankar in Static Analysis (2008)

  3. 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)

  4. 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)

  5. 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)

  6. No Access

    Chapter and Conference Paper

    Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct

    We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which the combinatorial representat...

    Priti Shankar, P.N.A. Kumar, Harmeet Singh… in Automata, Languages and Programming (2001)

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

  8. No Access

    Chapter and Conference Paper

    On the Many Faces of Block Codes

    Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder complexity. Necessary and sufficient c...

    Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan in STACS 2000 (2000)

  9. No Access

    Chapter and Conference Paper

    Optimal Regular Tree Pattern Matching Using Pushdown Automata

    We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a pushdown automaton in contrast with the...

    Maya Madhavan, Priti Shankar in Foundations of Software Technology and The… (1998)