Sciweavers

960 search results - page 49 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
164
Voted
ICN
2005
Springer
15 years 9 months ago
Two Energy-Efficient Routing Algorithms for Wireless Sensor Networks
: Power Conservation is one of the most important challenges in wireless sensor networks. In this paper, we present two minimum-energy routing algorithms. Our main goal is to reduc...
Hung Le Xuan, Youngku Lee, Sungyoung Lee
132
Voted
CBMS
2006
IEEE
15 years 9 months ago
Pre-Indexing for Fast Partial Shape Matching of Vertebrae Images
Fast retrieval of images from large databases especially from large medical image databases is of great interest to researchers. We have developed shape-based image retrieval syst...
Xiaoqian Xu, D. J. Lee, Sameer Antani, L. Rodney L...
137
Voted
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
15 years 5 months ago
Robust Clustering in Arbitrarily Oriented Subspaces
In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...
Elke Achtert, Christian Böhm, Jörn David...
156
Voted
SOSP
1997
ACM
15 years 5 months ago
Towards Transparent and Efficient Software Distributed Shared Memory
Despite a large research effort, software distributed shared memory systems have not been widely used to run parallel applications across clusters of computers. The higher perform...
Daniel J. Scales, Kourosh Gharachorloo
135
Voted
DBISP2P
2008
Springer
124views Database» more  DBISP2P 2008»
15 years 5 months ago
Exploiting Distribution Skew for Scalable P2P Text Clustering
K-Means clustering is widely used in information retrieval and data mining. Distributed K-Means variants have already been proposed, but none of the past algorithms scales to large...
Odysseas Papapetrou, Wolf Siberski, Fabian Leitrit...