Sciweavers

497 search results - page 15 / 100
» On a Parallel Extended Euclidean Algorithm
Sort
View
ICDE
1999
IEEE
183views Database» more  ICDE 1999»
14 years 9 months ago
ROCK: A Robust Clustering Algorithm for Categorical Attributes
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
13 years 2 months ago
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
Timothy M. Chan
SFP
2000
13 years 9 months ago
Parallel heuristic search in Haskell
Abstract: Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describes novel parallel variants of two standard sequential search algorithms...
Michelle Cope, Ian P. Gent, Kevin Hammond
ICDE
1999
IEEE
209views Database» more  ICDE 1999»
14 years 9 months ago
Parallel Classification for Data Mining on Shared-Memory Multiprocessors
We present parallel algorithms for building decision-tree classifiers on shared-memory multiprocessor (SMP) systems. The proposed algorithms span the gamut of data and task parall...
Mohammed Javeed Zaki, Ching-Tien Ho, Rakesh Agrawa...
BMCBI
2010
189views more  BMCBI 2010»
13 years 7 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...