231 search results - page 4 / 47 » Context Matching for Compressed Terms |
VLDB
1987
ACM
13 years 10 months ago
1987
ACM
In this paper, a new compression method for constant removal from very large scientific and statistical databases is presented. The new method combines the best features from seve...
ICIP
2003
IEEE
14 years 9 months ago
2003
IEEE
Images typically contain smooth regions, which are easily compressed by linear transforms, and high activity regions (edges, textures), which are harder to compress. To compress t...
ICIP
2001
IEEE
14 years 9 months ago
2001
IEEE
In this paper, we present a novel fidelity constraint for the image enhancement problem by exploiting the motion vectors of a compressed video bit-stream. These vectors establish ...
ISCA
1998
IEEE
13 years 11 months ago
1998
IEEE
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
LPAR
2005
Springer
14 years 25 days ago
2005
Springer
We describe a sound, terminating, and complete matching algorithm for terms built over flexible arity function symbols and context, function, sequence, and individual variables. C...