719 search results - page 52 / 144 » Solving Sparse Linear Constraints |
123
click to vote
SIAMREV
2010
14 years 5 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
CGF
2008
14 years 10 months ago
2008
We present a spectral approach to automatically and efficiently obtain discrete free-boundary conformal parameterizations of triangle mesh patches, without the common artifacts du...
ACL
1994
15 years 1 days ago
1994
We present an algorithm for computing n-gram probabilities from stochastic context-free grammars, a procedure that can alleviate some of the standard problems associated with n-gr...
IMCSIT
2010
14 years 8 months ago
2010
The authors consider the impact of the structure of the matrix on the convergence behavior for the GMRES projection method for solving large sparse linear equation systems resultin...
PRDC
2007
IEEE
15 years 5 months ago
2007
IEEE
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...