Results 1  10
of
5,018
Tiling MultiDimensional Arrays
 In Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
, 1999
"... . We continue the study of the tiling problems introduced in [KMP98]. The rst problem we consider is: given a ddimensional array of nonnegative numbers and a tile limit p, partition the array into at most p rectangular, nonoverlapping subarrays, referred to as tiles, in such a way as to minim ..."
Abstract
 Add to MetaCart
. We continue the study of the tiling problems introduced in [KMP98]. The rst problem we consider is: given a ddimensional array of nonnegative numbers and a tile limit p, partition the array into at most p rectangular, nonoverlapping subarrays, referred to as tiles, in such a way
Tiling MultiDimensional Arrays
 In Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
, 1999
"... . We continue the study of the tiling problems introduced in [KMP98]. The rst problem we consider is: given a ddimensional array of nonnegative numbers and a tile limit p, partition the array into at most p rectangular, nonoverlapping subarrays, referred to as tiles, in such a way as to minimise ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
. We continue the study of the tiling problems introduced in [KMP98]. The rst problem we consider is: given a ddimensional array of nonnegative numbers and a tile limit p, partition the array into at most p rectangular, nonoverlapping subarrays, referred to as tiles, in such a way
Polydimensional Array Programming
 Partial Evaluation and Automatic Program Generation. International Series in Computer Science
, 1998
"... . FISh is the first language to support a polydimensional, data polymorphic type constructor for regular arrays. Now a fullytyped program may take a vector, matrix or higherdimensional regular array as argument. Regularity is defined using shape theory, which was also used to guide the language d ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
. FISh is the first language to support a polydimensional, data polymorphic type constructor for regular arrays. Now a fullytyped program may take a vector, matrix or higherdimensional regular array as argument. Regularity is defined using shape theory, which was also used to guide the language
Twodimensional arrays with maximal complexity
, 2006
"... We present natural bounds for the complexity function of twodimensional arrays, and we study the shape of the maximal complexity function. Some problems concerning the existence of maximal arrays are discussed. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present natural bounds for the complexity function of twodimensional arrays, and we study the shape of the maximal complexity function. Some problems concerning the existence of maximal arrays are discussed.
Searching Monotone Multidimensional Arrays ⋆
"... A ddimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d, a monotone increasing ddimensional array with n entries along each dimension, and a real number x, we want to decide whether x ∈ An,d, by performing a sequence of comp ..."
Abstract
 Add to MetaCart
A ddimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d, a monotone increasing ddimensional array with n entries along each dimension, and a real number x, we want to decide whether x ∈ An,d, by performing a sequence
Einstein summation for multidimensional arrays
, 2000
"... One of the most common data abstractions, at least in scientific computing, is the multidimensional array. A numerical algorithm may sometimes conveniently be expressed as a generalized matrix multiplication, which computes a multidimensional array from two other multidimensional arrays. By adopt ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
One of the most common data abstractions, at least in scientific computing, is the multidimensional array. A numerical algorithm may sometimes conveniently be expressed as a generalized matrix multiplication, which computes a multidimensional array from two other multidimensional arrays
THREEDIMENSIONAL ARRAYS
"... Establishment D6f one Atlantic Atlantique Canadc! 1:10 The program BMPAT is a FORTRAN 77 program designed to readily evaluate the amplitude and phase response of general threedimensional sonar receiving arrays to plane wave arrivals. The program output is directed to two output files, one for ampli ..."
Abstract
 Add to MetaCart
Establishment D6f one Atlantic Atlantique Canadc! 1:10 The program BMPAT is a FORTRAN 77 program designed to readily evaluate the amplitude and phase response of general threedimensional sonar receiving arrays to plane wave arrivals. The program output is directed to two output files, one
attractors in onedimensional arrays of
"... HB technique for the classi cation of periodic and chaotic ..."
Generalized multipartitioning for multidimensional arrays
 In Proceedings of the International Parallel and Distributed Processing Symposium, Fort Lauderdale, FL
, 2002
"... Multipartitioning is a strategy for parallelizing computations that require solving 1D recurrences along each dimension of a multidimensional array. Previous techniques for multipartitioning yield efficient parallelizations over 3D domains only when the number of processors is a perfect square. Thi ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
Multipartitioning is a strategy for parallelizing computations that require solving 1D recurrences along each dimension of a multidimensional array. Previous techniques for multipartitioning yield efficient parallelizations over 3D domains only when the number of processors is a perfect square
Results 1  10
of
5,018