Sciweavers

1887 search results - page 179 / 378
» Clustering with Local Restrictions
Sort
View
JAVA
2001
Springer
15 years 11 months ago
Implementation of a portable software DSM in Java
Rapid commoditization of advanced hardware and progress of networking technology is now making wide area high-performance computing a.k.a. the ‘Grid’ Computing a reality. Sinc...
Yukihiko Sohda, Hidemoto Nakada, Satoshi Matsuoka
KDD
1998
ACM
106views Data Mining» more  KDD 1998»
15 years 10 months ago
Analysing Rock Samples for the Mars Lander
In the near future NASAintends to explore various regions of our solar systemusing robotic devices such as rovers, spacecraft, airplanes, and/or balloons. Such platforms will carr...
Jonathan J. Oliver, Ted Roush, Paul Gazis, Wray L....
IJHPCA
2010
113views more  IJHPCA 2010»
15 years 5 months ago
Accurate Heterogeneous Communication Models and a Software Tool for Their Efficient Estimation
In this paper, we analyze restrictions of traditional communication performance models affecting the accuracy of analytical prediction of the execution time of collective communic...
Alexey L. Lastovetsky, Vladimir Rychkov, Maureen O...
PVM
2010
Springer
15 years 5 months ago
Massively Parallel Finite Element Programming
Abstract. Today’s large finite element simulations require parallel algorithms to scale on clusters with thousands or tens of thousands of processor cores. We present data struc...
Timo Heister, Martin Kronbichler, Wolfgang Bangert...
TASLP
2011
15 years 1 months ago
Time-Domain Blind Separation of Audio Sources on the Basis of a Complete ICA Decomposition of an Observation Space
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
Zbynek Koldovský, Petr Tichavský