1391 search results - page 189 / 279 » Optimally Sparse Frames |
172
click to vote
SIAMIS
2010
14 years 11 months ago
2010
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
148
click to vote
TSMC
2010
14 years 11 months ago
2010
A generalized or tunable-kernel model is proposed for probability density function estimation based on an orthogonal forward regression procedure. Each stage of the density estimat...
164
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...
170
Voted
ICCV
2011
IEEE
14 years 5 months ago
2011
IEEE
This paper addresses view-invariant object detection and pose estimation from a single image. While recent work focuses on object-centered representations of point-based object fe...
201
click to vote
JMLR
2012
13 years 7 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...