Sciweavers

573 search results - page 24 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
ML
2002
ACM
127views Machine Learning» more  ML 2002»
13 years 8 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
3DPVT
2004
IEEE
316views Visualization» more  3DPVT 2004»
14 years 23 days ago
A Statistical Method for Robust 3D Surface Reconstruction from Sparse Data
Abstract-General information about a class of objects, such as human faces or teeth, can help to solve the otherwise ill-posed problem of reconstructing a complete surface from spa...
Volker Blanz, Albert Mehl, Thomas Vetter, Hans-Pet...
PPAM
2007
Springer
14 years 3 months ago
A Supernodal Out-of-Core Sparse Gaussian-Elimination Method
Abstract. We present an out-of-core sparse direct solver for unsymmetric linear systems. The solver factors the coefficient matrix A into A = PLU using Gaussian elimination with pa...
Sivan Toledo, Anatoli Uchitel
CVPR
2010
IEEE
14 years 5 months ago
Fast Matting Using Large Kernel Matting Laplacian Matrices
Image matting is of great importance in both computer vision and graphics applications. Most existing state-of-the-art techniques rely on large sparse matrices such as the matting ...
Kaiming He, Jian Sun, Xiaoou Tang
AOR
2010
13 years 6 months ago
Sphere Methods for LP
The sphere method for solving linear programs operates with only a subset of constraints in the model in each iteration, and thus has the advantage of handling instances which may...
Katta G. Murty, Mohammad R. Oskoorouchi