Compression schemes for EEG signals are developed based on matrix and tensor decomposition. Various ways to arrange EEG signals into matrices and tensors are explored, and several...
Justin Dauwels, K. Srinivasan, M. Ramasubba Reddy,...
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...
Texture mapping has traditionally been used to add visual realism to computer graphics images. In the paper we propose an alternative technique for image texture handling. We use ...
object should be visible which were not visible in any of the images used to represent the object. So far these problems have been addressed by compression schemes [9] and restrict...
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Most existing lossless image compression schemes operate on grey-scale images. However, in the case of colour images, higher compression ratios can be achieved by exploiting inter...
Steven Van Assche, Wilfried Philips, Ignace Lemahi...
In this paper, we study the effects of compression on bitmap indexes. The main operations on the bitmaps during query processing are bitwise logical operations such as AND, OR, N...
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
In this paper a novel scheme for colored video compression using color transfer techniques is proposed. Color transfer for video sequences is made more accurate by incorporation of...
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, A...