Sciweavers

124 search results - page 6 / 25
» Dimension Is Compression
Sort
View
ARC
2008
Springer
112views Hardware» more  ARC 2008»
13 years 9 months ago
Lossless Compression for Space Imagery in a Dynamically Reconfigurable Architecture
Abstract. This paper presents a novel dynamically reconfigurable hardware architecture for lossless compression and its optimization for space imagery. The proposed system makes us...
Xiaolin Chen, Cedric Nishan Canagarajah, Raffaele ...
JMLR
2008
104views more  JMLR 2008»
13 years 7 months ago
Nearly Uniform Validation Improves Compression-Based Error Bounds
This paper develops bounds on out-of-sample error rates for support vector machines (SVMs). The bounds are based on the numbers of support vectors in the SVMs rather than on VC di...
Eric Bax
ICDE
2004
IEEE
125views Database» more  ICDE 2004»
14 years 8 months ago
Range CUBE: Efficient Cube Computation by Exploiting Data Correlation
Data cube computation and representation are prohibitively expensive in terms of time and space. Prior work has focused on either reducing the computation time or condensing the r...
Ying Feng, Divyakant Agrawal, Amr El Abbadi, Ahmed...
ICML
2007
IEEE
14 years 8 months ago
Sample compression bounds for decision trees
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
Mohak Shah
MCS
2008
Springer
13 years 7 months ago
Dynamical low-rank approximation: applications and numerical experiments
Dynamical low-rank approximation is a differential-equation based approach to efficiently computing low-rank approximations to time-dependent large data matrices or to solutions o...
Achim Nonnenmacher, Christian Lubich