Results 1  10
of
2,376
ENERGY EFFICIENT PARAMETERIZED FFT ARCHITECTURE∗
"... Recently, there has been a growing interest within the research community to improve energy efficiency. In this paper, we revisit the classic Fast Fourier Transform (FFT) for energy efficient designs on FPGAs. Parameterized FFT architecture is proposed to identify design tradeoffs in achieving ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Recently, there has been a growing interest within the research community to improve energy efficiency. In this paper, we revisit the classic Fast Fourier Transform (FFT) for energy efficient designs on FPGAs. Parameterized FFT architecture is proposed to identify design tradeoffs in achieving
Efficient Parameterization for the Dimensional Reduction Problem
, 2003
"... A new method to optimize with orthonormal constraints is described, where a particular composition of plane (Givens) rotations is used to parameterize decision variables in terms of angles. It is showed that this parameterization is complete and that any orthonormal kbyn matrix can be derived to a ..."
Abstract
 Add to MetaCart
A new method to optimize with orthonormal constraints is described, where a particular composition of plane (Givens) rotations is used to parameterize decision variables in terms of angles. It is showed that this parameterization is complete and that any orthonormal kbyn matrix can be derived
An efficient parameterized algorithm for mset packing
 Journal of Algorithms
"... We present an efficient parameterized algorithm solving the Set Packing problem, in which we assume that the size of the sets is bounded by m. In particular, if the size m of the sets is bounded by a constant, then our algorithm is fixedparameter tractable. For example, if the size of the sets is b ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
We present an efficient parameterized algorithm solving the Set Packing problem, in which we assume that the size of the sets is bounded by m. In particular, if the size m of the sets is bounded by a constant, then our algorithm is fixedparameter tractable. For example, if the size of the sets
Efficient Parameterized Algorithm for Biopolymer StructureSequence Alignment
 In Proceedings of Workshop on Algorithms for Bioinformatics
, 2005
"... Abstract. Computational alignment of a biopolymer sequence (e.g., an RNA or a protein) to a structure is an effective approach to predict and search for the structure of new sequences. To identify the structure of remote homologs, the structuresequence alignment has to consider not only sequence si ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
novel method and a parameterized algorithm for structuresequence alignment. Both the structure and the sequence are represented as graphs, where in general the graph for a biopolymer structure has a naturally small tree width. The algorithm constructs an optimal alignment by finding in the sequence
AN EFFICIENT PARAMETERIZATION FOR PARETOOPTIMAL BEAMFORMERS FOR KUSER MIMO INTERFERENCE CHANNELS
"... ABSTRACT In this paper, Paretooptimal beamforming in the Kpair Gaussian multipleinput multipleoutput (MIMO) interference channel is considered. Under the assumption of Gaussian signaling at transmitters and singleuser decoding at receivers, a necessary condition for any transmit signal covaria ..."
Abstract
 Add to MetaCart
covariance matrix to achieve a Pareto boundary point of the achievable rate region is derived. Based on the necessary condition for Paretooptimality, an efficient parameterization for Paretooptimal transmit signal covariance matrices is obtained. The obtained parameter space is given by the product
Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow
, 1999
"... In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating highfidelit ..."
Abstract

Cited by 542 (23 self)
 Add to MetaCart
fidelity computer graphics objects using imperfectlymeasured data from the real world. Our approach contains three novel features: an implicit integration method to achieve efficiency, stability, and large timesteps; a scaledependent Laplacian operator to improve the diffusion process; and finally, a robust
EFFICIENT PARAMETERIZATION OF LARGESCALE DYNAMIC MODELS THROUGH THE USE OF ACTIVITY ANALYSIS
"... Previous research presents both sensitivitybased and principal componentbased techniques for improving the tractability of system identification. Both have proven viable, but the former may be computationally inefficient for large problems, and the latter require a change of realization that may c ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
compromise the physical meaning of the parameters to be identified. This paper proposes for the first time the use of activity analysis, an efficient and realizationpreserving model reduction technique, for identification space reduction. Theoretical and numerical studies highlighting the viability
A Parametric Texture Model based on Joint Statistics of Complex Wavelet Coefficients
 INTERNATIONAL JOURNAL OF COMPUTER VISION
, 2000
"... We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed on pairs of coefficients corresponding to basis functions at adjacent spatial locations, orientations, and scales. We de ..."
Abstract

Cited by 424 (13 self)
 Add to MetaCart
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed on pairs of coefficients corresponding to basis functions at adjacent spatial locations, orientations, and scales. We
MAPS: Multiresolution Adaptive Parameterization of Surfaces
, 1998
"... We construct smooth parameterizations of irregular connectivity triangulations of arbitrary genus 2manifolds. Our algorithm uses hierarchical simplification to efficiently induce a parameterization of the original mesh over a base domain consisting of a small number of triangles. This initial param ..."
Abstract

Cited by 265 (12 self)
 Add to MetaCart
We construct smooth parameterizations of irregular connectivity triangulations of arbitrary genus 2manifolds. Our algorithm uses hierarchical simplification to efficiently induce a parameterization of the original mesh over a base domain consisting of a small number of triangles. This initial
Results 1  10
of
2,376