Sciweavers

8669 search results - page 216 / 1734
» Computing matrix representations
Sort
View
ICPR
2000
IEEE
14 years 2 months ago
Two-Stage Computational Cost Reduction Algorithm Based on Mahalanobis Distance Approximations
For many pattern recognition methods, high recognition accuracy is obtained at very high expense of computational cost. In this paper, a new algorithm that reduces the computation...
Fang Sun, Shinichiro Omachi, Nei Kato, Hirotomo As...
JMIV
2010
78views more  JMIV 2010»
13 years 4 months ago
Unified Computation of Strict Maximum Likelihood for Geometric Fitting
A new numerical scheme is presented for strictly computing maximum likelihood (ML) of geometric fitting problems. Intensively studied in the past are those methods that first tran...
Kenichi Kanatani, Yasuyuki Sugaya
CCGRID
2003
IEEE
14 years 3 months ago
Distributed Computing with Hierarchical Master-worker Paradigm for Parallel Branch and Bound Algorithm
This paper discusses the impact of the hierarchical master-worker paradigm on performance of an application program, which solves an optimization problem by a parallel branch and ...
Kento Aida, Wataru Natsume, Yoshiaki Futakata
AMC
2007
90views more  AMC 2007»
13 years 9 months ago
Computing the square roots of matrices with central symmetry
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...
Zhongyun Liu, Yulin Zhang, Rui Ralha
CORR
2011
Springer
213views Education» more  CORR 2011»
13 years 1 months ago
Symbolic computation of weighted Moore-Penrose inverse using partitioning method
We propose a method and algorithm for computing the weighted MoorePenrose inverse of one-variable rational matrices. Also, we develop an algorithm for computing the weighted Moore...
Milan B. Tasic, Predrag S. Stanimirovic, Marko D. ...