Results 1  10
of
26,337
Revisiting Framework of Linear Loop Transformation
, 1995
"... This paper extends the framework of linear loop transformations adding a new nonlineal step at the transformation process. The current framework of linear loop transformation cannot identify a significant fraction of parallelism. For this reason, we present a method to complement it with some basic ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
This paper extends the framework of linear loop transformations adding a new nonlineal step at the transformation process. The current framework of linear loop transformation cannot identify a significant fraction of parallelism. For this reason, we present a method to complement it with some
Linear Loop Transformations in Optimizing Compilers for Parallel Machines
, 1995
"... We present the linear loop transformation framework which is the formal basis for state of the art optimization techniques in restructuring compilers for parallel machines. The framework unifies most existing transformations and provides a systematic set of code generation techniques for arbitrary c ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We present the linear loop transformation framework which is the formal basis for state of the art optimization techniques in restructuring compilers for parallel machines. The framework unifies most existing transformations and provides a systematic set of code generation techniques for arbitrary
A Generalized Theory of Linear Loop Transformations
, 1994
"... In this paper we present a new theory of linear loop transformations called Computation Decomposition and Alignment (CDA). A CDA transformation has two components: Computation Decomposition first decomposes the computations in the loop into computations of finer granularity, from iterations to insta ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this paper we present a new theory of linear loop transformations called Computation Decomposition and Alignment (CDA). A CDA transformation has two components: Computation Decomposition first decomposes the computations in the loop into computations of finer granularity, from iterations
A Generalized Theory of Linear Loop Transformations
, 1994
"... In this paper we present a new theory of linear loop transformations called Computation Decomposition and Alignment (CDA). A CDA transformation has two components: Computation Decomposition first decomposes the computations in the loop into computations of finer granularity, from iterations to insta ..."
Abstract
 Add to MetaCart
In this paper we present a new theory of linear loop transformations called Computation Decomposition and Alignment (CDA). A CDA transformation has two components: Computation Decomposition first decomposes the computations in the loop into computations of finer granularity, from iterations
Align and Distributebased Linear Loop Transformations
, 1993
"... In this paper we generalize the framework of linear loop transformations in the sense that loop alignment is considered as a new component in the transformation process. The aim is to match the structure of loop nests with the data distribution and alignment in order to eliminate nonlocal reference ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
In this paper we generalize the framework of linear loop transformations in the sense that loop alignment is considered as a new component in the transformation process. The aim is to match the structure of loop nests with the data distribution and alignment in order to eliminate non
An analysis of transformations
 Journal of the Royal Statistical Society. Series B (Methodological
, 1964
"... In the analysis of data it is often assumed that observations y,, y,,...,y, are independently normally distributed with constant variance and with expectations specified by a model linear in a set of parameters 0. In this paper we make the less restrictive assumption that such a normal, homoscedasti ..."
Abstract

Cited by 1067 (3 self)
 Add to MetaCart
, homoscedastic, linear model is appropriate after some suitable transformation has been applied to the y's. Inferences about the transformation and about the parameters of the linear model are made by computing the likelihood function and the relevant posterior distribution. The contributions of normality
Maximum Likelihood Linear Transformations for HMMBased Speech Recognition
 COMPUTER SPEECH AND LANGUAGE
, 1998
"... This paper examines the application of linear transformations for speaker and environmental adaptation in an HMMbased speech recognition system. In particular, transformations that are trained in a maximum likelihood sense on adaptation data are investigated. Other than in the form of a simple bias ..."
Abstract

Cited by 570 (68 self)
 Add to MetaCart
This paper examines the application of linear transformations for speaker and environmental adaptation in an HMMbased speech recognition system. In particular, transformations that are trained in a maximum likelihood sense on adaptation data are investigated. Other than in the form of a simple
Studies of transformation of Escherichia coli with plasmids
 J. Mol. Biol
, 1983
"... Factors that affect he probability of genetic transformation f Escherichia coli by plasmids have been evaluated. A set of conditions is described under which about one in every 400 plasmid molecules produces a transformed cell. These conditions include cell growth in medium containing elevated level ..."
Abstract

Cited by 1632 (1 self)
 Add to MetaCart
Factors that affect he probability of genetic transformation f Escherichia coli by plasmids have been evaluated. A set of conditions is described under which about one in every 400 plasmid molecules produces a transformed cell. These conditions include cell growth in medium containing elevated
Factoring wavelet transforms into lifting steps
 J. FOURIER ANAL. APPL
, 1998
"... This paper is essentially tutorial in nature. We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed into a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures. This decompositio ..."
Abstract

Cited by 584 (8 self)
 Add to MetaCart
This paper is essentially tutorial in nature. We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed into a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures
A NEW POLYNOMIALTIME ALGORITHM FOR LINEAR PROGRAMMING
 COMBINATORICA
, 1984
"... We present a new polynomialtime algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than the ell ..."
Abstract

Cited by 860 (3 self)
 Add to MetaCart
We present a new polynomialtime algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than
Results 1  10
of
26,337