Sciweavers

178 search results - page 30 / 36
» LSMR: An iterative algorithm for sparse least-squares proble...
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 7 months ago
Polynomial Linear Programming with Gaussian Belief Propagation
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev
BIRTHDAY
2010
Springer
14 years 15 days ago
Indexing and Searching a Mass Spectrometry Database
Abstract. Database preprocessing in order to create an index often permits considerable speedup in search compared to the iterated query of an unprocessed database. In this paper w...
Søren Besenbacher, Benno Schwikowski, Jens ...
CVPR
2009
IEEE
15 years 2 months ago
Illumination and Spatially Varying Specular Reflectance from a Single View
Estimating the illumination and the reflectance properties of an object surface from a sparse set of images is an important but inherently ill-posed problem. The problem becomes...
Kenji Hara (Kyushu University), Ko Nishino (Drexel...
CVPR
2011
IEEE
13 years 4 months ago
Sparsity-based Image Denoising via Dictionary Learning and Structural Clustering
Where does the sparsity in image signals come from? Local and nonlocal image models have supplied complementary views toward the regularity in natural images the former attempts t...
Weisheng Dong, Xin Li
CVPR
2010
IEEE
14 years 3 months ago
Learning Full Pairwise Affinities for Spectral Segmentation
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
Tae Hoon Kim (Seoul National University), Kyoung M...