54 search results - page 8 / 11 » Fast and Efficient Compression of Floating-Point Data |
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
ICCV
2009
IEEE
15 years 10 days ago
2009
IEEE
Scenes with cast shadows can produce complex sets of
images. These images cannot be well approximated by lowdimensional
linear subspaces. However, in this paper we
show that the...
SAC
2002
ACM
13 years 7 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
We present a simple and efficient entropy coder that combines run-length and Golomb-Rice encoders. The encoder automatically switches between the two modes according to simple rul...