• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 5,018
Next 10 →

Tiling Multi-Dimensional Arrays

by Jonathan Sharp Department, Jonathan P. Sharp, Coventry Cv Al - 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 d-dimensional array of non-negative numbers and a tile limit p, partition the array into at most p rectangular, non-overlapping 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 d-dimensional array of non-negative numbers and a tile limit p, partition the array into at most p rectangular, non-overlapping subarrays, referred to as tiles, in such a way

Tiling Multi-Dimensional Arrays

by Jonathan P. Sharp, Coventry Cv Al - 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 d-dimensional array of non-negative numbers and a tile limit p, partition the array into at most p rectangular, non-overlapping 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 d-dimensional array of non-negative numbers and a tile limit p, partition the array into at most p rectangular, non-overlapping subarrays, referred to as tiles, in such a way

Poly-dimensional Array Programming

by C. B. Jay - Partial Evaluation and Automatic Program Generation. International Series in Computer Science , 1998
"... . FISh is the first language to support a poly-dimensional, data polymorphic type constructor for regular arrays. Now a fully-typed program may take a vector, matrix or higher-dimensional 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 poly-dimensional, data polymorphic type constructor for regular arrays. Now a fully-typed program may take a vector, matrix or higher-dimensional regular array as argument. Regularity is defined using shape theory, which was also used to guide the language

Two-dimensional arrays with maximal complexity

by Mira-cristiana Anisiu, Antal Iványi , 2006
"... We present natural bounds for the complexity function of two-dimensional 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 two-dimensional arrays, and we study the shape of the maximal complexity function. Some problems concerning the existence of maximal arrays are discussed.

Searching Monotone Multi-dimensional Arrays ⋆

by Yongxi Cheng A, Xiaoming Sun B, Yiqun Lisa Yin C
"... A d-dimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d, a monotone increasing d-dimensional 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 d-dimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d, a monotone increasing d-dimensional 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 multi-dimensional arrays

by Krister Åhlander , 2000
"... One of the most common data abstractions, at least in scientific computing, is the multi-dimensional array. A numerical algorithm may sometimes conveniently be expressed as a generalized matrix multiplication, which computes a multi-dimensional array from two other multi-dimensional 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 multi-dimensional array. A numerical algorithm may sometimes conveniently be expressed as a generalized matrix multiplication, which computes a multi-dimensional array from two other multi-dimensional arrays

THREE-DIMENSIONAL ARRAYS

by Apr Drea-tc-/ F/g U, Dwense Nationale, A. J. Collier, Defence Centre De, Enational Defence Dfense Nationals, A. J. Collier, Defence Centre De
"... 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 three-dimensional 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 three-dimensional sonar receiving arrays to plane wave arrivals. The program output is directed to two output files, one

two-dimensional array

by Tobias Bergsten, Tord Claeson, Per Delsing , 2000
"... blockade thermometry using a ..."
Abstract - Add to MetaCart
blockade thermometry using a

attractors in one-dimensional arrays of

by Marco Gilli, Pier Paolo Civalleri
"... HB technique for the classi cation of periodic and chaotic ..."
Abstract - Add to MetaCart
HB technique for the classi cation of periodic and chaotic

Generalized multipartitioning for multi-dimensional arrays

by Alain Darte, Daniel Chavarría-miranda, Robert Fowler, John Mellor-crummey - 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 multi-dimensional 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 multi-dimensional array. Previous techniques for multipartitioning yield efficient parallelizations over 3D domains only when the number of processors is a perfect square
Next 10 →
Results 1 - 10 of 5,018
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University