The aim of this paper is to promote the idea of developing reusable coordination patterns for parallel computing, i.e. customizable components from which parallel applications can ...
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
This paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching u...
Abstract. Experiments of neural network training procedure parallelization are conducted. Several styles of parallelization are described and compared, estimations of neural networ...
Abstract. Exploiting the diversity of hypotheses produced by evolutionary learning, a new ensemble approach for Feature Selection is presented, aggregating the feature rankings ext...