Sciweavers

774 search results - page 31 / 155
» A subdivision-based algorithm for the sparse resultant
Sort
View
FOCM
2010
140views more  FOCM 2010»
15 years 2 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen
EC
1998
178views ECommerce» more  EC 1998»
15 years 4 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
CVPR
2010
IEEE
15 years 10 months ago
Fast Sparse Representation with Prototypes
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
Jia-Bin Huang, Ming-Hsuan Yang
ICMCS
2008
IEEE
151views Multimedia» more  ICMCS 2008»
15 years 10 months ago
Fast keyword detection with sparse time-frequency models
We address the problem of keyword spotting in continuous speech streams when training and testing conditions can be different. We propose a keyword spotting algorithm based on spa...
Effrosini Kokiopoulou, Pascal Frossard, Olivier Ve...
ICPR
2010
IEEE
15 years 9 months ago
On the Dimensionality Reduction for Sparse Representation Based Face Recognition
Face recognition (FR) is an active yet challenging topic in computer vision applications. As a powerful tool to represent high dimensional data, recently sparse representation bas...
Lei Zhang, Meng Yang, Zhizhao Feng, David Zhang