Sciweavers

421 search results - page 38 / 85
» A divide-and-merge methodology for clustering
Sort
View
CCGRID
2003
IEEE
15 years 3 months ago
A Parallel FPT Application For Clusters
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
James Cheetham, Frank K. H. A. Dehne, Andrew Rau-C...
ISCA
2007
IEEE
217views Hardware» more  ISCA 2007»
14 years 10 months ago
Parallel Processing of High-Dimensional Remote Sensing Images Using Cluster Computer Architectures
Hyperspectral sensors represent the most advanced instruments currently available for remote sensing of the Earth. The high spatial and spectral resolution of the images supplied ...
David Valencia, Antonio Plaza, Pablo Martín...
PAISI
2010
Springer
14 years 8 months ago
Efficient Privacy Preserving K-Means Clustering
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
ICSM
2009
IEEE
14 years 7 months ago
Decomposing object-oriented class modules using an agglomerative clustering technique
Software can be considered a live entity, as it undergoes many alterations throughout its lifecycle. Furthermore, developers do not usually retain a good design in favor of adding...
Marios Fokaefs, Nikolaos Tsantalis, Alexander Chat...
FGCS
2008
103views more  FGCS 2008»
14 years 10 months ago
A case for cooperative and incentive-based federation of distributed clusters
Research interest in Grid computing has grown significantly over the past five years. Management of distributed resources is one of the key issues in Grid computing. Central to ma...
Rajiv Ranjan, Aaron Harwood, Rajkumar Buyya