Sciweavers

171 search results - page 29 / 35
» Convex Sparse Matrix Factorizations
Sort
View
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 4 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
JMLR
2010
173views more  JMLR 2010»
13 years 1 months ago
Collaborative Filtering via Rating Concentration
While most popular collaborative filtering methods use low-rank matrix factorization and parametric density assumptions, this article proposes an approach based on distribution-fr...
Bert Huang, Tony Jebara
CVPR
2012
IEEE
11 years 9 months ago
Fixed-rank representation for unsupervised visual learning
Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-theart technique...
Risheng Liu, Zhouchen Lin, Fernando De la Torre, Z...
CVPR
2011
IEEE
13 years 3 months ago
Online Group-Structured Dictionary Learning
We develop a dictionary learning method which is (i) online, (ii) enables overlapping group structures with (iii) non-convex sparsity-inducing regularization and (iv) handles the ...
Zoltan Szabo, Barnabas Poczos, Andras Lorincz
CIMAGING
2010
202views Hardware» more  CIMAGING 2010»
13 years 8 months ago
An optimal algorithm for reconstructing images from binary measurements
We have studied a camera with a very large number of binary pixels referred to as the gigavision camera [1] or the gigapixel digital film camera [2, 3]. Potential advantages of th...
Feng Yang, Yue M. Lu, Luciano Sbaiz, Martin Vetter...