9886 search results - page 372 / 1978 » Learning Compressible Models |
161
click to vote
TNN
2010
14 years 11 months ago
2010
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
122
click to vote
ICPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We present a new method for compact representation of large image datasets. Our method is based on treating small patches from an image as matrices as opposed to the conventional ...
135
click to vote
DCC
2002
IEEE
16 years 4 months ago
2002
IEEE
On-line adaptation to nonstationary distributions is essential to good performance in image coding. Fixed-size contexts (with adaptive tables) are also widely used, in conjunction...
134
click to vote
IPTPS
2004
Springer
15 years 10 months ago
2004
Springer
We propose a new cryptographic technique, Acknowledgment Compression, permitting senders of multicast data to verify that all interested parties have either received the data or l...
137
click to vote
KDD
1995
ACM
15 years 8 months ago
1995
ACM
We report a novel possibility for extracting a small subset of a data base which contains all the information necessary to solve a given classification task: using the Support Vec...