Defeasible logic is an efficient non-monotonic logic that is defined only proof-theoretically. It has potential application in some legal domains. We present here an argumentatio...
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code. Recent mo...
In this work, we are mainly dealing with the stitching of panoramic images. However, the methods described and evaluated here can also be used for different applications in image ...
Abstract. We present here a methodology for programming active networks in the environment dened by our new language PLAN (Packet Language for Active Networks). This environment p...
Michael W. Hicks, Pankaj Kakkar, Jonathan T. Moore...
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...