598 search results - page 19 / 120 » Procedure Based Program Compression |
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
ENTCS
2007
13 years 7 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
ECOOP
2007
Springer
14 years 1 months ago
2007
Springer
64-bit address spaces come at the price of pointers requiring twice as much memory as 32-bit address spaces, resulting in increased memory usage. Increased memory usage is especia...
HPDC
2005
IEEE
14 years 1 months ago
2005
IEEE
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
VTC
2010
IEEE
13 years 6 months ago
2010
IEEE
—In this paper, we present a near-lossless compression scheme for scalar-quantized source codec parameters based on iterative source-channel decoding (ISCD). The scheme is compar...