Sciweavers

5 search results - page 1 / 1
» Computing Partial Sums in Multidimensional Arrays
Sort
View
COMPGEOM
1989
ACM
13 years 11 months ago
Computing Partial Sums in Multidimensional Arrays
d Abstract) Bernard Chazelle Burton Rosenberg Department of Computer Science Princeton University
Bernard Chazelle, Burton Rosenberg
SSDBM
1999
IEEE
140views Database» more  SSDBM 1999»
13 years 11 months ago
An Infrastructure for Scalable Parallel Multidimensional Analysis
Multidimensional Analysis in On-Line Analytical Processing (OLAP), and Scientific and statistical databases (SSDB) use operations requiring summary information on multi-dimensiona...
Sanjay Goil, Alok N. Choudhary
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 7 months ago
Efficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
John C. Bowman, Malcolm Roberts
IPPS
2006
IEEE
14 years 1 months ago
Memory minimization for tensor contractions using integer linear programming
This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and...
A. Allam, J. Ramanujam, Gerald Baumgartner, P. Sad...
IPPS
2007
IEEE
14 years 1 months ago
Miss Ratio Improvement For Real-Time Applications Using Fragmentation-Aware Placement
Partially reconfigurable Field-Programmable Gate Arrays (FPGAs) allow parts of the chip to be configured at run-time where each part could hold an independent task. Online place...
Ahmed Abou ElFarag, Hatem M. El-Boghdadi, Samir I....