Sciweavers

2463 search results - page 10 / 493
» Compressing Pattern Databases
Sort
View
DCC
2003
IEEE
14 years 7 months ago
Performance of universal codes over infinite alphabets
It is known that universal compression of strings generated by i.i.d. sources over infinite alphabets entails infinite per-symbol redundancy. Continuing previous work [1], we cons...
Alon Orlitsky, Narayana P. Santhanam
DATE
2005
IEEE
171views Hardware» more  DATE 2005»
14 years 1 months ago
Access Pattern-Based Code Compression for Memory-Constrained Embedded Systems
As compared to a large spectrum of performance optimizations, relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space r...
Ozcan Ozturk, Hendra Saputra, Mahmut T. Kandemir, ...
DCC
2010
IEEE
13 years 10 months ago
A Fast Compact Prefix Encoding for Pattern Matching in Limited Resources Devices
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
S. Harrusi, Amir Averbuch, N. Rabin
ICIP
2004
IEEE
14 years 9 months ago
CVPIC image retrieval based on block colour co-occurance matrix and pattern histogram
Compressed domain image processing techniques are becoming increasingly important. Compressed domain retrieval It allows the calculation of image features and hence content-based ...
Gerald Schaefer, Simon Lieutaud, Guoping Qiu
SAC
2010
ACM
13 years 5 months ago
The 'Dresden Image Database' for benchmarking digital image forensics
This paper introduces and documents a novel image database specifically built for the purpose of development and benchmarking of camera-based digital forensic techniques. More th...
Thomas Gloe, Rainer Böhme