Sciweavers

23 search results - page 4 / 5
» Near-optimal sparse fourier representations via sampling
Sort
View
JMLR
2012
11 years 8 months ago
Multi-label Subspace Ensemble
A challenging problem of multi-label learning is that both the label space and the model complexity will grow rapidly with the increase in the number of labels, and thus makes the...
Tianyi Zhou, Dacheng Tao
FOCM
2010
122views more  FOCM 2010»
13 years 3 months ago
Scattering in Flatland: Efficient Representations via Wave Atoms
This paper presents a numerical compression strategy for the boundary integral equation of acoustic scattering in two dimensions. These equations have oscillatory kernels that we ...
Laurent Demanet, Lexing Ying
CISS
2008
IEEE
14 years 13 days ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
CVPR
2010
IEEE
14 years 2 months ago
Efficient Additive Kernels via Explicit Feature Maps
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...
Andrea Vedaldi, Andrew Zisserman
ICASSP
2008
IEEE
14 years 12 days ago
Time-frequency localization from sparsity constraints
In the case of multicomponent AM-FM signals, the idealized representation which consists of weighted trajectories on the time-frequency (TF) plane, is intrinsically sparse. Recent...
Pierre Borgnat, Patrick Flandrin