Sciweavers

354 search results - page 1 / 71
» Recovery Rate of Clustering Algorithms
Sort
View
PSIVT
2009
Springer
139views Multimedia» more  PSIVT 2009»
13 years 9 months ago
Recovery Rate of Clustering Algorithms
This article provides a simple and general way for defining the recovery rate of clustering algorithms using a given family of old clusters for evaluating the performance of the a...
Fajie Li, Reinhard Klette
CSMR
2004
IEEE
13 years 8 months ago
Architecture-Aware Adaptive Clustering of OO Systems
The recovery of software architecture is a first important step towards re-engineering a software system. Architecture recovery usually involves clustering. The problem with curre...
Markus Bauer, Mircea Trifu
IWPC
1998
IEEE
13 years 9 months ago
Using Automatic Clustering to Produce High-Level System Organizations of Source Code
This paper describes a collection of algorithms that we developed and implemented to facilitate the automatic recovery of the modular structure of a software system from its sourc...
Spiros Mancoridis, Brian S. Mitchell, C. Rorres, Y...
CORR
2011
Springer
214views Education» more  CORR 2011»
12 years 8 months ago
K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
Piotr Indyk, Eric Price
PVM
2005
Springer
13 years 10 months ago
Scalable Fault Tolerant MPI: Extending the Recovery Algorithm
ct Fault Tolerant MPI (FT-MPI)[6] was designed as a solution to allow applications different methods to handle process failures beyond simple check-point restart schemes. The init...
Graham E. Fagg, Thara Angskun, George Bosilca, Jel...