Sciweavers

513 search results - page 20 / 103
» Software Components Capture Using Graph Clustering
Sort
View
EURODAC
1995
IEEE
128views VHDL» more  EURODAC 1995»
14 years 17 days ago
Closeness metrics for system-level functional partitioning
An important system design task is the partitioning of system functionality for implementation among multiple system components, including partitions among hardware and software c...
Frank Vahid, Daniel D. Gajski
CSMR
2004
IEEE
14 years 23 days ago
The Weighted Combined Algorithm: A Linkage Algorithm for Software Clustering
Software systems need to evolve as business requirements, technology and environment change. As software is modified to accommodate the required changes, its structure deteriorate...
Onaiza Maqbool, Haroon A. Babri
CASCON
1997
98views Education» more  CASCON 1997»
13 years 10 months ago
An approach to software architecture analysis for evolution and reusability
Software evolution and reuse is more likely to receive higher payoff if high-level artifacts—such as architectures and designs—can be reused and can guide low-level component ...
Chung-Horng Lung, Sonia Bot, Kalai Kalaichelvan, R...
JGAA
2007
124views more  JGAA 2007»
13 years 9 months ago
Energy Models for Graph Clustering
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...
Andreas Noack
ICPR
2010
IEEE
13 years 7 months ago
Semi-supervised Graph Learning: Near Strangers or Distant Relatives
In this paper, an easily implemented semi-supervised graph learning method is presented for dimensionality reduction and clustering, using the most of prior knowledge from limited...
Weifu Chen, Guocan Feng