441 search results - page 67 / 89 » Sparse Recovery Using Sparse Random Matrices |
ICPP
2006
IEEE
15 years 3 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
CP
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
105
click to vote
CVPR
2012
IEEE
13 years 8 days ago
2012
IEEE
Top-down visual saliency facilities object localization by providing a discriminative representation of target objects and a probability map for reducing the search space. In this...
ICMCS
2005
IEEE
15 years 3 months ago
2005
IEEE
A gridding Hough transform (GHT) is proposed to detect the straight lines in sports video, which is much faster and requires much less memory than the previous Hough transforms. T...
JMLR
2010
14 years 4 months ago
2010
Methods based on 1-relaxation, such as basis pursuit and the Lasso, are very popular for sparse regression in high dimensions. The conditions for success of these methods are now ...