Sciweavers

1391 search results - page 47 / 279
» Optimally Sparse Frames
Sort
View
ICASSP
2011
IEEE
14 years 7 months ago
A clustering based framework for dictionary block structure identification
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
Ender M. Eksioglu
CORR
2010
Springer
315views Education» more  CORR 2010»
14 years 11 months ago
Light-Hierarchy: The Optimal Structure for Multicast Routing in WDM Mesh Networks
Abstract--Based on the false assumption that multicast incapable (MI) nodes could not be traversed twice on the same wavelength, the light-tree structure was always thought to be o...
Fen Zhou, Miklós Molnár, Bernard Cou...
146
Voted
CORR
2010
Springer
253views Education» more  CORR 2010»
15 years 4 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...
SIAMNUM
2010
120views more  SIAMNUM 2010»
14 years 10 months ago
Sparse Spectral Approximations of High-Dimensional Problems Based on Hyperbolic Cross
Hyperbolic cross approximations by some classical orthogonal polynomials/functions in both bounded and unbounded domains are considered in this paper. Optimal error estimates in pr...
Jie Shen, Li-lian Wang
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 10 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...