Sciweavers

890 search results - page 79 / 178
» An Experimental Comparison of Stereo Algorithms
Sort
View
PAKDD
2007
ACM
143views Data Mining» more  PAKDD 2007»
16 years 13 days ago
Clustering Ensembles Based on Normalized Edges
The co-association (CA) matrix was previously introduced to combine multiple partitions. In this paper, we analyze the CA matrix, and address its difference from the similarity ma...
Yan Li, Jian Yu, Pengwei Hao, Zhulin Li
WCRE
2005
IEEE
15 years 12 months ago
Multiple Layer Clustering of Large Software Systems
Software clustering algorithms presented in the literature rarely incorporate in the clustering process dynamic information, such as the number of function invocations during runt...
Bill Andreopoulos, Aijun An, Vassilios Tzerpos, Xi...
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 10 months ago
gLINC: identifying composability using group perturbation
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
David Jonathan Coffin, Christopher D. Clack
AI
2005
Springer
15 years 6 months ago
Asynchronous backtracking without adding links: a new member in the ABT family
Following the pioneer work of Yokoo and colleagues on the ABT (asynchronous backtracking) algorithm, several ABT-based procedures have been proposed for solving distributed constr...
Christian Bessière, Arnold Maestre, Ismel B...
INFSOF
2007
101views more  INFSOF 2007»
15 years 6 months ago
Clustering large software systems at multiple layers
Software clustering algorithms presented in the literature rarely incorporate in the clustering process dynamic information, such as the number of function invocations during runt...
Bill Andreopoulos, Aijun An, Vassilios Tzerpos, Xi...