Sciweavers

1693 search results - page 48 / 339
» fast 2008
Sort
View
DATAMINE
1999
113views more  DATAMINE 1999»
13 years 8 months ago
A Fast Parallel Clustering Algorithm for Large Spatial Databases
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,...
Xiaowei Xu, Jochen Jäger, Hans-Peter Kriegel
TPDS
2002
94views more  TPDS 2002»
13 years 8 months ago
Recursive Array Layouts and Fast Matrix Multiplication
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...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....
TFS
2008
190views more  TFS 2008»
13 years 8 months ago
A Fast Geometric Method for Defuzzification of Type-2 Fuzzy Sets
Generalised type-2 fuzzy logic systems can not currently be used for practical problems because the amount of computation required to defuzzify a generalised type-2 fuzzy set is to...
Simon Coupland, Robert John
SIGOPS
2010
91views more  SIGOPS 2010»
13 years 7 months ago
FastAD: an authenticated directory for billions of objects
We develop techniques that make authenticated directories efficient and scalable toward the goal of managing tens of billions of objects in a single directory. Internet storage s...
Paul T. Stanton, Benjamin McKeown, Randal C. Burns...
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