Sciweavers

2034 search results - page 139 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
14 years 1 months ago
Search-based improvement of subsystem decompositions
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
Olaf Seng, Markus Bauer, Matthias Biehl, Gert Pach...
ACMSE
2009
ACM
14 years 2 months ago
Applying randomized projection to aid prediction algorithms in detecting high-dimensional rogue applications
This paper describes a research effort to improve the use of the cosine similarity information retrieval technique to detect unknown, known or variances of known rogue software by...
Travis Atkison
CCGRID
2001
IEEE
13 years 11 months ago
Cluster Computing in the Classroom: Topics, Guidelines, and Experiences
- With the progress of research on cluster computing, more and more universities have begun to offer various courses covering cluster computing. A wide variety of content can be ta...
Amy W. Apon, Rajkumar Buyya, Hai Jin, Jens Mache
TIP
2010
97views more  TIP 2010»
13 years 2 months ago
Image Clustering Using Local Discriminant Models and Global Integration
In this paper, we propose a new image clustering algorithm, referred to as Clustering using Local Discriminant Models and Global Integration (LDMGI). To deal with the data points s...
Yi Yang, Dong Xu, Feiping Nie, Shuicheng Yan, Yuet...
ENTCS
2008
108views more  ENTCS 2008»
13 years 8 months ago
E-matching for Fun and Profit
Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quant...
Michal Moskal, Jakub Lopuszanski, Joseph R. Kiniry