2303 search results - page 17 / 461 » Interior-Point Methods in Parallel Computation |
KDD
2004
ACM
14 years 8 months ago
2004
ACM
The computation of covariance and correlation matrices are critical to many data mining applications and processes. Unfortunately the classical covariance and correlation matrices...
VLSID
2001
IEEE
14 years 8 months ago
2001
IEEE
ICPPW
2006
IEEE
14 years 1 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
COMPUTING
2006
13 years 7 months ago
2006
The polyhedral homotopy continuation method is known to be a successful method for finding all isolated solutions of a system of polynomial equations. PHoM, an implementation of t...
JPDC
2007
13 years 7 months ago
2007
The solution of linear and nonlinear convection–diffusion problems via parallel subdomain methods is considered. MPI implementation of parallel Schwarz alternating methods on di...