441 search results - page 50 / 89 » Sparse Recovery Using Sparse Random Matrices |
120
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code DG(m, r). This meth...
110
Voted
ICIAP
2003
ACM
16 years 4 months ago
2003
ACM
In this paper we present a statistical learning scheme for image classification based on a mixture of old fashioned ideas and state of the art learning tools. We represent input i...
133
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
130
Voted
ACIVS
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. This paper addresses the problem of self-calibration and motion recovery for turntable sequences. Previous works exploited silhouette correspondences induced by epipolar ...
117
click to vote
NIPS
2007
15 years 5 months ago
2007
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...