573 search results - page 62 / 115 » On Wiedemann's Method of Solving Sparse Linear Systems |
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
Boosting is a remarkably simple and flexible classification algorithm with widespread applications in computer vision. However, the application of boosting to nonEuclidean, infini...
PRDC
2007
IEEE
14 years 3 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...
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
SIAMSC
2010
13 years 7 months ago
2010
Abstract. A smoothed aggregation multigrid method is presented for the numerical calculation of the stationary probability vector of an irreducible sparse Markov chain. It is shown...
EUROPAR
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. ILU(k) is a commonly used preconditioner for iterative linear solvers for sparse, non-symmetric systems. It is often preferred for the sake of its stability. We present T...