1550 search results - page 111 / 310 » Benchmarking for Graph Transformation |
157
click to vote
SAS
2010
Springer
15 years 1 months ago
2010
Springer
The efficiency of a points-to analysis is critical for several compiler optimizations and transformations, and has attracted considerable research attention. Despite several advanc...
136
click to vote
KDD
2005
ACM
16 years 3 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
128
Voted
NETWORKS
2008
15 years 3 months ago
2008
We present a new efficient approach for solving the multicommodity flow problem as a sequence of subproblems, each on a very sparse but connected network. We show that each subpro...
105
Voted
ECOOP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Our research group has analyzed many industrial, frameworkbased applications. In these applications, simple functionality often requires excessive runtime activity. It is...
116
click to vote
GD
1998
Springer
15 years 7 months ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...