6897 search results - page 285 / 1380 » Parallelization of Modular Algorithms |
120
click to vote
SPAA
1992
ACM
15 years 7 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...
102
click to vote
COLING
1996
15 years 4 months ago
1996
We present an approach to parallel natural language parsing which is based on a concurrent, object-oriented model of computation. A depth-first, yet incomplete parsing algorithm f...
132
click to vote
SIGMOD
1997
ACM
15 years 7 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
134
click to vote
ICPP
1997
IEEE
15 years 7 months ago
1997
IEEE
r The lack of a versatile software tool for parallel program development has been one of the major obstacles for exploiting the potential of high-performance architectures. In this...
154
click to vote
ESA
1999
Springer
15 years 7 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...