Sciweavers

719 search results - page 78 / 144
» Solving Sparse Linear Constraints
Sort
View
CGF
2010
113views more  CGF 2010»
14 years 11 months ago
Signing the Unsigned: Robust Surface Reconstruction from Raw Pointsets
We propose a modular framework for robust 3D reconstruction from unorganized, unoriented, noisy, and outlierridden geometric data. We gain robustness and scalability over previous...
Patrick Mullen, Fernando de Goes, Mathieu Desbrun,...
JSCIC
2008
43views more  JSCIC 2008»
14 years 11 months ago
A Dual-Petrov-Galerkin Method for the Kawahara-Type Equations
Abstract An efficient and accurate numerical scheme is proposed, analyzed and implemented for the Kawahara and modified Kawahara equations which model many physical phenomena such ...
Juan-Ming Yuan, Jie Shen, Jiahong Wu
TOMS
2011
84views more  TOMS 2011»
14 years 6 months ago
A Supernodal Approach to Incomplete LU Factorization with Partial Pivoting
We present a new supernode-based incomplete LU factorization method to construct a preconditioner for solving sparse linear systems with iterative methods. The new algorithm is pr...
Xiaoye S. Li, Meiyue Shao
MOC
2010
14 years 5 months ago
Sharpness in rates of convergence for the symmetric Lanczos method
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the...
Ren-Cang Li
ICCV
2007
IEEE
15 years 5 months ago
Support Kernel Machines for Object Recognition
Kernel classifiers based on Support Vector Machines (SVM) have recently achieved state-of-the art results on several popular datasets like Caltech or Pascal. This was possible by...
Ankita Kumar, Cristian Sminchisescu