Sciweavers

4695 search results - page 236 / 939
» Software Clustering Techniques and the Use of Combined Algor...
Sort
View
EMSOFT
2004
Springer
15 years 12 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
CIKM
2008
Springer
15 years 8 months ago
Scalable community discovery on textual data with relations
Every piece of textual data is generated as a method to convey its authors' opinion regarding specific topics. Authors deliberately organize their writings and create links, ...
Huajing Li, Zaiqing Nie, Wang-Chien Lee, C. Lee Gi...
MCS
2007
Springer
16 years 21 days ago
Selecting Diversifying Heuristics for Cluster Ensembles
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
Stefan Todorov Hadjitodorov, Ludmila I. Kuncheva
CVPR
2010
IEEE
16 years 3 months ago
Discriminative Clustering for Image Co-segmentation
Purely bottom-up, unsupervised segmentation of a single image into two segments remains a challenging task for computer vision. The co-segmentation problem is the process of joi...
Armand Joulin, Francis Bach, Jean Ponce
PPOPP
2006
ACM
16 years 16 days ago
Minimizing execution time in MPI programs on an energy-constrained, power-scalable cluster
Recently, the high-performance computing community has realized that power is a performance-limiting factor. One reason for this is that supercomputing centers have limited power ...
Robert Springer, David K. Lowenthal, Barry Rountre...