Sciweavers

957 search results - page 15 / 192
» From Margin to Sparsity
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 5 months ago
CUR from a Sparse Optimization Viewpoint
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...
Jacob Bien, Ya Xu, Michael W. Mahoney
ICA
2004
Springer
14 years 29 days ago
On the Strong Uniqueness of Highly Sparse Representations from Redundant Dictionaries
A series of recent results shows that if a signal admits a sufficiently sparse representation (in terms of the number of nonzero coefficients) in an “incoherent” dictionary, th...
Rémi Gribonval, Morten Nielsen
NIPS
2008
13 years 9 months ago
Bounds on marginal probability distributions
We propose a novel bound on single-variable marginal probability distributions in factor graphs with discrete variables. The bound is obtained by propagating local bounds (convex ...
Joris M. Mooij, Hilbert J. Kappen
CVPR
2007
IEEE
14 years 9 months ago
Feature Extraction by Maximizing the Average Neighborhood Margin
A novel algorithm called Average Neighborhood Margin Maximization (ANMM) is proposed for supervised linear feature extraction. For each data point, ANMM aims at pulling the neighb...
Fei Wang, Changshui Zhang
ERCIMDL
2009
Springer
89views Education» more  ERCIMDL 2009»
14 years 2 months ago
Improving Annotations in Digital Documents
Annotation plays a major role in a user’s reading of a document: from elementary school students making notes on text books to professors marking up their latest research papers....
Jennifer Pearson, George Buchanan, Harold W. Thimb...