16 search results - page 1 / 4 » Separator Based Parallel Divide and Conquer in Computational... |
SPAA
1992
ACM
13 years 9 months ago
1992
ACM
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...
SGAI
2009
Springer
13 years 11 months ago
2009
Springer
In a world where data is captured on a large scale the major challenge for data mining algorithms is to be able to scale up to large datasets. There are two main approaches to indu...
FSS
2010
13 years 3 months ago
2010
Fuzzy Cognitive Maps (FCMs) are a convenient tool for modeling and simulating dynamic systems. FCMs were applied in a large number of diverse areas and have already gained momentu...
ICPP
1987
IEEE
13 years 8 months ago
1987
IEEE
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
IPPS
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov C...