Sciweavers

4 search results - page 1 / 1
» Generalized Multipartitioning for Multi-Dimensional Arrays
Sort
View
IPPS
2002
IEEE
13 years 9 months ago
Generalized Multipartitioning for Multi-Dimensional Arrays
Multipartitioning is a strategy for parallelizing computations that require solving 1D recurrences along each dimension of a multi-dimensional array. Previous techniques for multi...
Daniel G. Chavarría-Miranda, Alain Darte, R...
CW
2002
IEEE
13 years 9 months ago
Efficient Data Compression Methods for Multi-Dimensional Sparse Array Operations
For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage...
Chun-Yuan Lin, Yeh-Ching Chung, Jen-Shiuh Liu
KDD
2012
ACM
271views Data Mining» more  KDD 2012»
11 years 7 months ago
GigaTensor: scaling tensor analysis up by 100 times - algorithms and discoveries
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
U. Kang, Evangelos E. Papalexakis, Abhay Harpale, ...
ICCAD
2003
IEEE
136views Hardware» more  ICCAD 2003»
14 years 1 months ago
Synthesis of Heterogeneous Distributed Architectures for Memory-Intensive Applications
— Memory-intensive applications present unique challenges to an ASIC designer in terms of the choice of memory organization, memory size requirements, bandwidth and access latenc...
Chao Huang, Srivaths Ravi, Anand Raghunathan, Nira...