Sciweavers

20 search results - page 2 / 4
» Fast signal analysis and decomposition on graphs using the S...
Sort
View
JMLR
2012
11 years 8 months ago
Sparse Higher-Order Principal Components Analysis
Traditional tensor decompositions such as the CANDECOMP / PARAFAC (CP) and Tucker decompositions yield higher-order principal components that have been used to understand tensor d...
Genevera Allen
DAC
1996
ACM
13 years 9 months ago
Efficient Full-Wave Electromagnetic Analysis via Model-Order Reduction of Fast Integral Transforms
Abstract-An efficient full-wave electromagnetic analysis tool would be useful in many aspects of engineering design. Development of integral-equation based tools has been hampered ...
Joel R. Philips, Eli Chiprout, David D. Ling
EC
1998
178views ECommerce» more  EC 1998»
13 years 5 months ago
The Simple Genetic Algorithm and the Walsh Transform: Part I, Theory
This paper is the first part of a two part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary repres...
Michael D. Vose, Alden H. Wright
ICASSP
2011
IEEE
12 years 9 months ago
Sparse non-negative decomposition of speech power spectra for formant tracking
Many works on speech processing have dealt with auto-regressive (AR) models for spectral envelope and formant frequency estimation, mostly focusing on the estimation of the AR par...
Jean-Louis Durrieu, Jean-Philippe Thiran
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
14 years 5 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle