Results 1  10
of
159
Sorting by Parallel Insertion on a OneDimensional SubBus Array
 IEEE Trans. on Computers
, 1996
"... We consider the problem of sorting on a onedimensional subbus array of processors. The subbus broadcast operation makes possible a new class of parallel sorting algorithms whose complexity we analyze with the parallel insertion model. A sorting method, or sorting strategy, in the parallel insert ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the problem of sorting on a onedimensional subbus array of processors. The subbus broadcast operation makes possible a new class of parallel sorting algorithms whose complexity we analyze with the parallel insertion model. A sorting method, or sorting strategy, in the parallel
Optimal average case sorting on arrays
 Proceedings of the 12th Symposium on Theoretical Aspects of Computer Science, number 900 in Lecture Notes in Computer Science
, 1995
"... Abstract. We present algorithms for sorting and routing on twodimensional meshconnected parallel architectures that are optimal on average. If one processor has many packets then we asymptotically halve the up to now best running times. For a load of one optimal algorithms are known for the mesh. ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract. We present algorithms for sorting and routing on twodimensional meshconnected parallel architectures that are optimal on average. If one processor has many packets then we asymptotically halve the up to now best running times. For a load of one optimal algorithms are known for the mesh
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
image for each array element using discrete Fourier transform (DFT). The second step then is to create a fullFOV image from the set of intermediate images. To achieve this one must undo the signal superposition underlying the foldover effect. That is, for each pixel in the reduced FOV the signal
Discovering properties about arrays in simple programs
 PLDI’2008
, 2008
"... Array bound checking and array dependency analysis (for parallelization) have been widely studied. However, there are much less results about analyzing properties of array contents. In this paper, we propose a way of using abstract interpretation for discovering properties about array contents in so ..."
Abstract

Cited by 47 (1 self)
 Add to MetaCart
in some restricted cases: onedimensional arrays, traversed by simple “for ” loops. The basic idea, borrowed from [15], consists in partitioning arrays into symbolic intervals (e.g., [1, i−1], [i, i], [i + 1, n]), and in associating with each such interval I and each array A an abstract variable AI
On Optimal Dimension Reduction for Sensor Array Signal Processing
, 1993
"... The computational complexity for directionofarrival estimation using sensor arrays increase very rapidly with the number of sensors in the array. One way to lower the amount of computations is to employ some kind of reduction of the data dimension. This is usually accomplished by employing linear ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
The computational complexity for directionofarrival estimation using sensor arrays increase very rapidly with the number of sensors in the array. One way to lower the amount of computations is to employ some kind of reduction of the data dimension. This is usually accomplished by employing linear
A Model Of Spatial Sorting In Animal Groups, With An Application To Honeybee Swarm Movement
"... A selforganising model of group formation (in three dimensional space) based on simple rules of avoidance, attraction and alignment is used to examine the spatial dynamics of animal groups. We discuss the dierent types of behaviour resulting from this model due to changes in these rules. In particu ..."
Abstract
 Add to MetaCart
to the new site. The model investigates a hypothesis of how this guidance procedure occurs. We conclude from the results of the model that one possible way for this process to occur is for the knowledgeable bees to guide the other members of the swarm with spatial cues. Key words: Self
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
as to minimise the weight of the heaviest tile, where the weight of a tile is the sum of the elements that fall within it. For onedimensional arrays the problem can be solved optimally in polynomial time, where as for twodimensions arrays it is shown in [KMP98] that the problem is NPhard and an approximation
1 ICASH: Intelligently Coupled Array of SSD and HDD
"... This paper presents a new disk I/O architecture composed of an array of a flash memory SSD (solid state disk) and a hard disk drive (HDD) that are intelligently coupled by a special algorithm. We call this architecture ICASH: Intelligently Coupled Array of SSD and HDD. The SSD stores seldomchanged ..."
Abstract
 Add to MetaCart
This paper presents a new disk I/O architecture composed of an array of a flash memory SSD (solid state disk) and a hard disk drive (HDD) that are intelligently coupled by a special algorithm. We call this architecture ICASH: Intelligently Coupled Array of SSD and HDD. The SSD stores seldom
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
as to minimise the weight of the heaviest tile, where the weight of a tile is the sum of the elements that fall within it. For onedimensional arrays the problem can be solved optimally in polynomial time, whereas for twodimensional arrays it is shown in [KMP98] that the problem is NP
Results 1  10
of
159