Sciweavers

225 search results - page 13 / 45
» The Future Fast Fourier Transform
Sort
View
NIPS
2001
13 years 9 months ago
Fast, Large-Scale Transformation-Invariant Clustering
In previous work on "transformed mixtures of Gaussians" and "transformed hidden Markov models", we showed how the EM algorithm in a discrete latent variable mo...
Brendan J. Frey, Nebojsa Jojic
FPGA
2006
ACM
139views FPGA» more  FPGA 2006»
14 years 3 days ago
Fast and accurate resource estimation of automatically generated custom DFT IP cores
This paper presents an equation-based resource utilization model for automatically generated discrete Fourier transform (DFT) soft core IPs. The parameterized DFT IP generator all...
Peter A. Milder, Mohammad Ahmad, James C. Hoe, Mar...
DAC
1996
ACM
14 years 18 days ago
A Parallel Precorrected FFT Based Capacitance Extraction Program for Signal Integrity Analysis
In order to optimize interconnect to avoid signal integrity problems, very fast and accurate 3-D capacitance extraction is essential. Fast algorithms, such as the multipole or prec...
Narayan R. Aluru, V. B. Nadkarni, James White
IPPS
2008
IEEE
14 years 2 months ago
Parallel option pricing with Fourier Space Time-stepping method on Graphics Processing Units
With the evolution of Graphics Processing Units (GPUs) into powerful and cost-efficient computing architectures, their range of application has expanded tremendously, especially i...
Vladimir Surkov
CORR
2006
Springer
73views Education» more  CORR 2006»
13 years 8 months ago
A Fast and Accurate Nonlinear Spectral Method for Image Recognition and Registration
This article addresses the problem of two- and higher dimensional pattern matching, i.e. the identification of instances of a template within a larger signal space, which is a for...
Luciano da Fontoura Costa, Erik Bollt