2432 search results - page 107 / 487 » Using simple abstraction to reinvent computing for paralleli... |
LSSC
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
JPDC
2006
14 years 9 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
128
click to vote
DATAMINE
1999
14 years 9 months ago
1999
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
EUROPAR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Accurately modeling and predicting performance for largescale applications becomes increasingly difficult as system complexity scales dramatically. Analytic predictive mo...
HIPC
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...