Sciweavers

28 search results - page 1 / 6
» Computing f(A)b via Least Squares Polynomial Approximations
Sort
View
SIAMSC
2011
177views more  SIAMSC 2011»
12 years 11 months ago
Computing f(A)b via Least Squares Polynomial Approximations
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
Jie Chen, Mihai Anitescu, Yousef Saad
GECCO
2008
Springer
172views Optimization» more  GECCO 2008»
13 years 5 months ago
Recursive least squares and quadratic prediction in continuous multistep problems
XCS with computed prediction, namely XCSF, has been recently extended in several ways. In particular, a novel prediction update algorithm based on recursive least squares and the ...
Daniele Loiacono, Pier Luca Lanzi
ICCV
2009
IEEE
14 years 9 months ago
Sparse Representation of Cast Shadows via L1-Regularized Least Squares
Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by lowdimensional linear subspaces. However, in this paper we show that the...
Xue Mei, Haibin Ling, David W. Jacobs
CVPR
2008
IEEE
14 years 6 months ago
Least squares surface reconstruction from measured gradient fields
This paper presents a new method for the reconstruction of a surface from its ? and ? gradient field, measured, for example, via Photometric Stereo. The new algorithm produces the...
Matthew Harker, Paul O'Leary
SGP
2007
13 years 6 months ago
Data-dependent MLS for faithful surface approximation
In this paper we present a high-fidelity surface approximation technique that aims at a faithful reconstruction of piecewise-smooth surfaces from a scattered point set. The presen...
Yaron Lipman, Daniel Cohen-Or, David Levin