Sciweavers

49 search results - page 3 / 10
» Some ways to reduce the space dimension in polyhedra computa...
Sort
View
ICDE
2004
IEEE
125views Database» more  ICDE 2004»
14 years 7 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...
DCC
2008
IEEE
14 years 5 months ago
On vector space partitions and uniformly resolvable designs
Let Vn(q) denote a vector space of dimension n over the field with q elements. A set P of subspaces of Vn(q) is a partition of Vn(q) if every nonzero vector in Vn(q) is contained ...
Andrew Blinco, Saad El-Zanati, G. F. Seelinger, P....
SIAMMA
2011
97views more  SIAMMA 2011»
12 years 8 months ago
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald...
TASLP
2011
13 years 23 days ago
Time-Domain Blind Separation of Audio Sources on the Basis of a Complete ICA Decomposition of an Observation Space
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
Zbynek Koldovský, Petr Tichavský
ESANN
2008
13 years 7 months ago
Comparison of sparse least squares support vector regressors trained in primal and dual
In our previous work, we have developed sparse least squares support vector regressors (sparse LS SVRs) trained in the primal form in the reduced empirical feature space. In this p...
Shigeo Abe