2297 search results - page 108 / 460 » A fast APRIORI implementation |
DATAMINE
1999
14 years 10 months ago
1999
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
TPDS
2002
14 years 10 months ago
2002
The performance of both serial and parallel implementations of matrix multiplication is highly sensitive to memory system behavior. False sharing and cache conflicts cause traditi...
73
Voted
TVCG
2010
14 years 9 months ago
2010
—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...
106
Voted
ICASSP
2009
IEEE
14 years 8 months ago
2009
IEEE
The average consensus in wireless sensor networks is achieved under assumptions of symmetric or balanced topology at every time instant. However, communication and/or node failure...
TOG
2010
14 years 5 months ago
2010
We present a general framework for analyzing the transport matrix of a real-world scene at full resolution, without capturing many photos. The key idea is to use projectors and ca...