Sciweavers

556 search results - page 32 / 112
» Fast parallel GPU-sorting using a hybrid algorithm
Sort
View
TVCG
2010
141views more  TVCG 2010»
13 years 7 months ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
Michael Connor, Piyush Kumar
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
14 years 6 days ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
PDIS
1993
IEEE
14 years 23 days ago
Nested Loops Revisited
The research communityhas considered hash-based parallel joinalgorithmsthe algorithmsof choice for almosta decade. However, almostnone ofthe commercialparallel database systems us...
David J. DeWitt, Jeffrey F. Naughton, Joseph Burge...
FMSD
2002
114views more  FMSD 2002»
13 years 8 months ago
The Correctness of the Fast Fourier Transform: A Structured Proof in ACL2
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
Ruben Gamboa
IPPS
1998
IEEE
14 years 27 days ago
A Parallel Evolutionary Algorithm for the Vehicle Routing Problem with Heterogeneous Fleet
Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...
Luiz Satoru Ochi, Dalessandro Soares Vianna, L&uac...