Sciweavers

573 search results - page 44 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
CPHYSICS
2010
184views more  CPHYSICS 2010»
13 years 9 months ago
Parallel Newton-Krylov-Schwarz algorithms for the three-dimensional Poisson-Boltzmann equation in numerical simulation of colloi
We investigate fully parallel Newton-Krylov-Schwarz (NKS) algorithms for solving the large sparse nonlinear systems of equations arising from the finite element discretization of ...
Feng-Nan Hwang, Shang-Rong Cai, Yun-Long Shao, Jon...
DATAMINE
1999
140views more  DATAMINE 1999»
13 years 8 months ago
A Scalable Parallel Algorithm for Self-Organizing Maps with Applications to Sparse Data Mining Problems
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
Richard D. Lawrence, George S. Almasi, Holly E. Ru...
CSB
2005
IEEE
135views Bioinformatics» more  CSB 2005»
14 years 2 months ago
Inverse Design of Large Molecules using Linear Diophantine Equations
We have previously developed a method [1] for the inverse design of small ligands. This method can be used to design novel compounds with optimized properties (such as drugs) and ...
Shawn Martin, W. Michael Brown, Jean-Loup Faulon, ...
ICASSP
2010
IEEE
13 years 7 months ago
Human detection in images via L1-norm Minimization Learning
In recent years, sparse representation originating from signal compressed sensing theory has attracted increasing interest in computer vision research community. However, to our b...
Ran Xu, Baochang Zhang, Qixiang Ye, Jianbin Jiao
SAS
2010
Springer
143views Formal Methods» more  SAS 2010»
13 years 7 months ago
Points-to Analysis as a System of Linear Equations
The efficiency of a points-to analysis is critical for several compiler optimizations and transformations, and has attracted considerable research attention. Despite several advanc...
Rupesh Nasre, Ramaswamy Govindarajan