Sciweavers

898 search results - page 6 / 180
» An Analysis of Permutations in Arrays
Sort
View
88
Voted
ISSAC
1994
Springer
165views Mathematics» more  ISSAC 1994»
15 years 1 months ago
Constructing Permutation Representations for Large Matrix Groups
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
Gene Cooperman, Larry Finkelstein, Bryant W. York,...
FOCS
1998
IEEE
15 years 1 months ago
Towards an Optimal Bit-Reversal Permutation Program
The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hie...
Larry Carter, Kang Su Gatlin
TOPLAS
2002
89views more  TOPLAS 2002»
14 years 9 months ago
Efficient and precise array access analysis
A number of existing compiler techniques hinge on the analysis of array accesses in the program. The most important task in array access analysis is to collect the information abo...
Yunheung Paek, Jay Hoeflinger, David A. Padua
COSPS
2001
Springer
15 years 2 months ago
Automatic Array Privatization
Abstract. Array privatization is one of the most e ective transformations for the exploitation of parallelism. In this paper, we present a technique for automatic array privatizati...
Peng Tu, David A. Padua
BMCBI
2008
138views more  BMCBI 2008»
14 years 9 months ago
Methods for simultaneously identifying coherent local clusters with smooth global patterns in gene expression profiles
Background: The hierarchical clustering tree (HCT) with a dendrogram [1] and the singular value decomposition (SVD) with a dimension-reduced representative map [2] are popular met...
Yin-Jing Tien, Yun-Shien Lee, Han-Ming Wu, Chun-Ho...