Sciweavers

53 search results - page 4 / 11
» Optimal Partitions of Data In Higher Dimensions
Sort
View
DEXA
2005
Springer
80views Database» more  DEXA 2005»
14 years 1 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
BMCBI
2008
166views more  BMCBI 2008»
13 years 7 months ago
Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
Peter A. DiMaggio Jr., Scott R. McAllister, Christ...
DAWAK
2008
Springer
13 years 9 months ago
Efficient Data Distribution for DWS
The DWS (Data Warehouse Striping) technique is a data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables are distribute...
Raquel Almeida, Jorge Vieira, Marco Vieira, Henriq...
ADC
2003
Springer
127views Database» more  ADC 2003»
14 years 21 days ago
M+-tree : A New Dynamical Multidimensional Index for Metric Spaces
In this paper, we propose a new metric index, called M+ -tree, which is a tree dynamically organized for large datasets in metric spaces. The proposed M+ -tree takes full advantag...
Xiangmin Zhou, Guoren Wang, Jeffrey Xu Yu, Ge Yu
ICASSP
2008
IEEE
14 years 1 months ago
Address assignment sensitive variable partitioning and scheduling for DSPS with multiple memory banks
Multiple memory banks design is employed in many high performance DSP processors. This architectural feature supports higher memory bandwidth by allowing multiple data memory acce...
Chun Jason Xue, Tiantian Liu, Zili Shao, Jingtong ...