The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
We propose a new variable-sized-block method for VLIW code compression. Code compression traditionally works on fixed-sized blocks and its efficiency is limited by the small block...
This paper is an application of Ant Colony Metaheuristic (ACO) to the problem of image fractal compression using IFS. An ACO hybrid algorithm is proposed for image fractal compres...
We introduce a set theoretic framework for watermarking and illustrate its effectiveness by designing a hierarchical semi-fragile watermark that is tolerant to compression and all...
Oktay Altun, Gaurav Sharma, Mehmet Utku Celik, Mar...
In this paper we generalise the sentence compression task. Rather than simply shorten a sentence by deleting words or constituents, as in previous work, we rewrite it using additi...