Sciweavers

186 search results - page 1 / 38
» Fast Computation of Sparse Datacubes
Sort
View
VLDB
1997
ACM
83views Database» more  VLDB 1997»
13 years 9 months ago
Fast Computation of Sparse Datacubes
Kenneth A. Ross, Divesh Srivastava
DOLAP
1999
ACM
13 years 9 months ago
A Dynamic Load Balancing Strategy for Parallel Datacube Computation
In recent years, OLAP technologies have become one of the important applications in the database industry. In particular, the datacube operation proposed in [5] receives strong at...
Seigo Muto, Masaru Kitsuregawa
ICIP
2008
IEEE
14 years 7 months ago
Spatio-spectral reconstruction of the multispectral datacube using sparse recovery
Multispectral scene information is useful for radiometric graphics, material identification and imaging systems simulation. The multispectral scene can be described as a datacube,...
Manu Parmar, Steven Lansel, Brian A. Wandell
CCGRID
2003
IEEE
13 years 10 months ago
Parallel Multi-Dimensional ROLAP Indexing
This paper addresses the query performance issue for Relational OLAP (ROLAP) datacubes. We present a distributed multi-dimensional ROLAP indexing scheme which is practical to imple...
Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chapl...
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
12 years 8 months ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park