Sciweavers

481 search results - page 15 / 97
» A Fast Program Generator of Fast Fourier Transforms
Sort
View
ICCAD
1996
IEEE
95views Hardware» more  ICCAD 1996»
15 years 1 months ago
Semi-analytical techniques for substrate characterization in the design of mixed-signal ICs
A number of methods are presentedfor highly efficient calculation of substratecurrenttransport. A three-dimensionalGreen'sFunction based substrate representation, in combinat...
Edoardo Charbon, Ranjit Gharpurey, Alberto L. Sang...
ASAP
2009
IEEE
98views Hardware» more  ASAP 2009»
14 years 7 months ago
A Power-Scalable Switch-Based Multi-processor FFT
This paper examines the architecture, algorithm and implementation of a switch-based multi-processor realization of the fast Fourier transform (FFT). The architecture employs M pr...
Bassam Jamil Mohd, Earl E. Swartzlander Jr.
NIPS
2001
14 years 11 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
CORR
2006
Springer
73views Education» more  CORR 2006»
14 years 9 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
SOFSEM
2007
Springer
15 years 3 months ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach