Skip to main content

previous disabled Page of 2
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

    Article

    John Backus — Inventor of FORTRAN

    V. Rajaraman, Priti Shankar in Resonance (2007)

  4. No Access

    Article

    The evolution of compilers

    The term compiler was coined in the late forties, by Grace Murray Hopper, a pioneer who rose to the challenges of programming the first computers. The problem of translation from a source language into a target l...

    Priti Shankar in Resonance (2007)

  5. No Access

    Article

    Decoding Reed-Solomon codes using Euclid’s algorithm

    Reed-Solomon codes are indeed an elegant illustration of a very practical application of abstract algebra. An interesting discovery was the fact that Euclid’s algorithm for finding greatest common divisors of ...

    Priti Shankar in Resonance (2007)

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

  7. No Access

    Article

    David Huffman

    Priti Shankar in Resonance (2006)

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

  9. No Access

    Article

    Editorial

    Priti Shankar in Resonance (2005)

  10. No Access

    Article

    Editorial

    Priti Shankar in Resonance (2005)

  11. No Access

    Article

    Editorial

    Priti Shankar in Resonance (2005)

  12. No Access

    Article

    Editorial

    Priti Shankar in Resonance (2005)

  13. No Access

    Article

    Robert W Floyd (1936–2001)

    Priti Shankar in Resonance (2005)

  14. No Access

    Article

    Florence Jessie Mac Williams (1917-1990)

    Priti Shankar in Resonance (2005)

  15. No Access

    Article

    Expander codes

    Expander graphs are graphs in which every set of vertices has an unusually large number of neighbours. It is a remarkable fact that graphs of this kind exist. Even more remarkable is the spectrum of applicatio...

    Priti Shankar in Resonance (2005)

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

  17. No Access

    Article

    Madhu Sudan receives Nevanlinna Prize

    Meena Mahajan, Priti Shankar in Resonance (2002)

  18. No Access

    Article

    Claude Elwood Shannon

    Priti Shankar in Resonance (2002)

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

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

previous disabled Page of 2