1567 search results - page 39 / 314 » Compressing Relations and Indexes |
DCC
2003
IEEE
14 years 8 months ago
2003
IEEE
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...
CCP
2011
12 years 9 months ago
2011
This project will involve analysing some of the newer fast algorithms in comparison with an exhaustive full search algorithm for motion estimation in video encoders. It will invest...
FUN
2010
Springer
14 years 1 months ago
2010
Springer
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...
APPROX
2007
Springer
14 years 3 months ago
2007
Springer
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...
KAIS
2006
13 years 9 months ago
2006
XML has already become the de facto standard for specifying and exchanging data on the Web. However, XML is by nature verbose and thus XML documents are usually large in size, a fa...