loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Compression Conference (DCC'06)
Snowbird, Utah
March 28-March 30
ISBN: 0-7695-2545-8
ASCII Text
x 
 
Slobodan Vucetic, "A Fast Algorithm for Lossless Compression of Data Tables by Reordering," Data Compression Conference, pp. 469, Data Compression Conference (DCC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/DCC.2006.1,
author = {Slobodan Vucetic},
title = {A Fast Algorithm for Lossless Compression of Data Tables by Reordering},
journal ={Data Compression Conference},
volume = {0},
year = {2006},
issn = {1068-0314},
pages = {469},
doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.2006.1},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Compression Conference
TI - A Fast Algorithm for Lossless Compression of Data Tables by Reordering
SN - 1068-0314
SP
EP
A1 - Slobodan Vucetic,
PY - 2006
KW - null
VL - 0
JA - Data Compression Conference
ER -
 
Slobodan Vucetic, Temple University
A data table is represented as a matrix D = {x_i_j, i = 1...N, j = 1...M}, where N is number of rows, or data points, and M number of columns, or attributes. A major property of data tables is that they allow arbitrary permutations of rows and columns, without loss of information. This property can be used to improve compressibility of data tables by ordering of rows or columns in a way that that allows grouping of similar table elements.
Citation:
Slobodan Vucetic, "A Fast Algorithm for Lossless Compression of Data Tables by Reordering," dcc, pp.469, Data Compression Conference (DCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.