5606 search results - page 420 / 1122 » Randomization Techniques for Graphs. |
192
click to vote
BIRTHDAY
2008
Springer
15 years 8 months ago
2008
Springer
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...
184
click to vote
ENTCS
2008
15 years 6 months ago
2008
We describe the design and the present state of the verification tool Augur 2 which is currently being developed. It is based on Augur 1, a tool which can analyze graph transforma...
192
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
199
click to vote
SCAM
2008
IEEE
16 years 1 months ago
2008
IEEE
The JOANA project (Java Object-sensitive ANAlysis) is a program analysis infrastructure for the Java language. It contains a wide range of analysis techniques such as dependence g...
179
click to vote
DATE
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...