17760 search results - page 105 / 3552 » A Generalization of the Massey-Ding Algorithm |
153
Voted
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
Multi-view stereo methods reconstruct 3D geometry from images well for sufficiently textured scenes, but often fail to recover high-frequency surface detail, particularly for smo...
152
Voted
SIAMIS
2010
14 years 10 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...
158
Voted
SIAMSC
2010
14 years 10 months ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
131
Voted
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—The Dantzig selector is a recently introduced technique for near-optimal estimatation of sparse signals from a limited set of measurements. This paper offers an interpre...
115
Voted
IPL
2008
15 years 3 months ago
2008
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in w...