105 search results - page 5 / 21 » Tree Structure Compression with RePair |
IJFCS
2006
14 years 9 months ago
2006
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
TPDS
2008
14 years 9 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
CMS
2003
14 years 10 months ago
2003
Abstract. Wavelet packet decompositions generalize the classical pyramidal wavelet structure. We use the vast amount of possible wavelet packet decomposition structures to create a...
ICIP
1994
IEEE
15 years 10 months ago
1994
IEEE
ABSTRACT the pyramid. Recently, a number of promising quanMultiresolution imagedecompositions (e. g., wavelets), in conjunction with a variety of quantization schemes, have been sh...
115
click to vote
PPOPP
2011
ACM
14 years 7 days ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...