Sciweavers

1301 search results - page 78 / 261
» Bounded Version Vectors
Sort
View
150
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Online performance guarantees for sparse recovery
A K∗ -sparse vector x∗ ∈ RN produces measurements via linear dimensionality reduction as u = Φx∗ + n, where Φ ∈ RM×N (M < N), and n ∈ RM consists of independent ...
Raja Giryes, Volkan Cevher
134
Voted
ICML
2010
IEEE
15 years 4 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
114
Voted
CORR
2007
Springer
83views Education» more  CORR 2007»
15 years 3 months ago
Capacity of a Class of Modulo-Sum Relay Channels
—This paper characterizes the capacity of a class of modulo additive noise relay channels, in which the relay observes a corrupted version of the noise and has a separate channel...
Marko Aleksic, Peyman Razaghi, Wei Yu
115
Voted
JMLR
2006
105views more  JMLR 2006»
15 years 3 months ago
Some Theory for Generalized Boosting Algorithms
We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. ...
Peter J. Bickel, Yaacov Ritov, Alon Zakai
117
Voted
FUIN
2007
86views more  FUIN 2007»
15 years 3 months ago
Advances in Symmetric Sandpiles
A symmetric version of the well-known SPM model for sandpiles is introduced. We prove that the new model has fixed point dynamics. Although there might be several fixed points, ...
Enrico Formenti, Benoît Masson, Theophilos P...