Sciweavers

644 search results - page 44 / 129
» Graph structured program evolution
Sort
View
PAKDD
2010
ACM
193views Data Mining» more  PAKDD 2010»
14 years 10 months ago
As Time Goes by: Discovering Eras in Evolving Social Networks
Abstract. Within the large body of research in complex network analysis, an important topic is the temporal evolution of networks. Existing approaches aim at analyzing the evolutio...
Michele Berlingerio, Michele Coscia, Fosca Giannot...
ACL
2010
14 years 10 months ago
Global Learning of Focused Entailment Graphs
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
Jonathan Berant, Ido Dagan, Jacob Goldberger
CGO
2006
IEEE
15 years 6 months ago
Selecting Software Phase Markers with Code Structure Analysis
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...
Jeremy Lau, Erez Perelman, Brad Calder
WIOPT
2010
IEEE
14 years 10 months ago
K-shell decomposition for dynamic complex networks
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
Daniele Miorandi, Francesco De Pellegrini
MODELS
2010
Springer
14 years 10 months ago
Transforming Process Models: Executable Rewrite Rules versus a Formalized Java Program
Abstract. In the business process management community, transformations for process models are usually programmed using imperative languages (such as Java). The underlying mapping ...
Pieter Van Gorp, Rik Eshuis