Sciweavers

179 search results - page 8 / 36
» Compressing Configuration Data for Memory Limited Devices
Sort
View
DCC
2003
IEEE
14 years 7 months ago
PPM Model Cleaning
The Prediction by Partial Matching (PPM) algorithm uses a cumulative frequency count of input symbols in different contexts to estimate their probability distribution. Excellent c...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
SBBD
2004
114views Database» more  SBBD 2004»
13 years 8 months ago
On Coding Navigation Paths for In-Memory Navigation in Persistent Object Stores
We consider matrix index and navigation index approaches to in-memory navigation of persistent object stores. We demonstrate that both approaches can be re-formulated independentl...
Markus Kirchberg, Klaus-Dieter Schewe, Alexei Tret...
HIPEAC
2011
Springer
12 years 7 months ago
Decoupled zero-compressed memory
For each computer system generation, there are always applications or workloads for which the main memory size is the major limitation. On the other hand, in many cases, one could...
Julien Dusser, André Seznec
TC
2010
13 years 5 months ago
PERFECTORY: A Fault-Tolerant Directory Memory Architecture
—The number of CPUs in chip multiprocessors is growing at the Moore’s Law rate, due to continued technology advances. However, new technologies pose serious reliability challen...
Hyunjin Lee, Sangyeun Cho, Bruce R. Childers
DCC
2006
IEEE
14 years 7 months ago
Low-Complexity Compression of Short Messages
We describe a low-complexity scheme for lossless compression of short text messages. The method uses arithmetic coding and a specific statistical context model for prediction of s...
Stephan Rein, Clemens Gühmann, Frank H. P. Fi...