Sciweavers

6129 search results - page 201 / 1226
» A parallel LLL algorithm
Sort
View
ISMM
2011
Springer
13 years 16 days ago
Towards a Parallel Topological Watershed: First Results
Abstract. In this paper we present a parallel algorithm for the topological watershed, suitable for a shared memory parallel architecture. On a 24-core machine an average speed-up ...
Joël van Neerbos, Laurent Najman, Michael H. ...
POPL
2008
ACM
14 years 10 months ago
Much ado about two (pearl): a pearl on parallel prefix computation
This pearl develops a statement about parallel prefix computation in the spirit of Knuth's 0-1-Principle for oblivious sorting algorithms. It turns out that 0-1 is not quite ...
Janis Voigtländer
SPAA
1992
ACM
14 years 1 months ago
Separator Based Parallel Divide and Conquer in Computational Geometry
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...
Alan M. Frieze, Gary L. Miller, Shang-Hua Teng
COLING
1996
13 years 11 months ago
Restricted Parallelism in Object-Oriented Lexical Parsing
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...
Peter Neuhaus, Udo Hahn
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
14 years 1 months ago
Scalable Parallel Data Mining for Association Rules
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...
Eui-Hong Han, George Karypis, Vipin Kumar