Sciweavers

2034 search results - page 84 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
IJCAI
2007
13 years 9 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
PRIB
2009
Springer
100views Bioinformatics» more  PRIB 2009»
14 years 2 months ago
Evidence-Based Clustering of Reads and Taxonomic Analysis of Metagenomic Data
Abstract. The rapidly emerging field of metagenomics seeks to examine the genomic content of communities of organisms to understand their roles and interactions in an ecosystem. I...
Gianluigi Folino, Fabio Gori, Mike S. M. Jetten, E...
ICAI
2004
13 years 9 months ago
A Comparison of Resampling Methods for Clustering Ensembles
-- Combination of multiple clusterings is an important task in the area of unsupervised learning. Inspired by the success of supervised bagging algorithms, we propose a resampling ...
Behrouz Minaei-Bidgoli, Alexander P. Topchy, Willi...
PR
2007
116views more  PR 2007»
13 years 7 months ago
GAPS: A clustering method using a new point symmetry-based distance measure
In this paper, an evolutionary clustering technique is described that uses a new point symmetry-based distance measure. The algorithm is therefore able to detect both convex and n...
Sanghamitra Bandyopadhyay, Sriparna Saha
IPPS
1999
IEEE
14 years 7 days ago
A Flexible Clustering and Scheduling Scheme for Efficient Parallel Computation
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...
S. Chingchit, Mohan Kumar, Laxmi N. Bhuyan