25 search results - page 1 / 5 » Automatic Parallelization of Divide and Conquer Algorithms |
PPOPP
1999
ACM
13 years 8 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
SPAA
1992
ACM
13 years 8 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...
ICDCS
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract—Overlay network design for topic-based publish/subscribe systems is of primary importance because the overlay directly impacts the system’s performance. Determining a ...
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...
IJCNN
2006
IEEE
13 years 10 months ago
2006
IEEE
— Over time, neural networks have proven to be extremely powerful tools for data exploration with the capability to discover previously unknown dependencies and relationships in ...