Sciweavers

441 search results - page 50 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
CORR
2010
Springer
126views Education» more  CORR 2010»
14 years 4 months ago
Reed Muller Sensing Matrices and the LASSO
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...
A. Robert Calderbank, Sina Jafarpour
ICIAP
2003
ACM
15 years 10 months ago
Old fashioned state-of-the-art image classification
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...
Annalisa Barla, Francesca Odone, Alessandro Verri
FOCS
2009
IEEE
15 years 4 months ago
Faster Generation of Random Spanning Trees
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...
Jonathan A. Kelner, Aleksander Madry
ACIVS
2008
Springer
14 years 12 months ago
Motion Recovery for Uncalibrated Turntable Sequences Using Silhouettes and a Single Point
Abstract. This paper addresses the problem of self-calibration and motion recovery for turntable sequences. Previous works exploited silhouette correspondences induced by epipolar ...
Hui Zhang, Ling Shao, Kwan-Yee Kenneth Wong
NIPS
2007
14 years 11 months ago
Random Sampling of States in Dynamic Programming
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...
Christopher G. Atkeson, Benjamin Stephens