Sciweavers

513 search results - page 11 / 103
» Software Components Capture Using Graph Clustering
Sort
View
EDBT
2011
ACM
197views Database» more  EDBT 2011»
13 years 15 days ago
Symmetrizations for clustering directed graphs
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
Venu Satuluri, Srinivasan Parthasarathy
IRI
2003
IEEE
14 years 2 months ago
A Formal Framework for Design Component Contracts
– Building large software systems out of existing software components can save time and cost. These software components range from architectural and design components to binary c...
Jing Dong, Paulo S. C. Alencar, Donald D. Cowan
ACL
2006
13 years 10 months ago
Unsupervised Part-of-Speech Tagging Employing Efficient Graph Clustering
An unsupervised part-of-speech (POS) tagging system that relies on graph clustering methods is described. Unlike in current state-of-the-art approaches, the kind and number of dif...
Chris Biemann
EMSOFT
2004
Springer
14 years 2 months ago
Heterogeneous reactive systems modeling: capturing causality and the correctness of loosely time-triggered architectures (LTTA)
We present an extension of a mathematical framework proposed by the authors to deal with the composition of heterogeneous reactive systems. Our extended framework encompasses dive...
Albert Benveniste, Benoît Caillaud, Luca P. ...
CLUSTER
2004
IEEE
14 years 22 days ago
Rolls: modifying a standard system installer to support user-customizable cluster frontend appliances
The Rocks toolkit [9], [7], [10] uses a graph-based framework to describe the configuration of all node types (termed appliances) that make up a complete cluster. With hundreds of...
Greg Bruno, Mason J. Katz, Federico D. Sacerdoti, ...