Sciweavers

1188 search results - page 95 / 238
» Extended Graph Unification
Sort
View
GG
2010
Springer
14 years 11 months ago
On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...
Paolo Baldan, Alessandro Bruni, Andrea Corradini, ...
104
Voted
TIT
2011
209views more  TIT 2011»
14 years 5 months ago
Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
CVPR
2008
IEEE
16 years 3 days ago
Shape prior segmentation of multiple objects with graph cuts
We present a new shape prior segmentation method using graph cuts capable of segmenting multiple objects. The shape prior energy is based on a shape distance popular with level se...
Nhat Vu, B. S. Manjunath
ICDE
2006
IEEE
164views Database» more  ICDE 2006»
15 years 11 months ago
A Partition-Based Approach to Graph Mining
Existing graph mining algorithms typically assume that databases are relatively static and can fit into the main memory. Mining of subgraphs in a dynamic environment is currently ...
Junmei Wang, Wynne Hsu, Mong-Li Lee, Chang Sheng
SCAM
2007
IEEE
15 years 4 months ago
On Temporal Path Conditions in Dependence Graphs
Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express mo...
Andreas Lochbihler, Gregor Snelting