Sciweavers

820 search results - page 15 / 164
» Inducing Temporal Graphs
Sort
View
DAM
2008
87views more  DAM 2008»
13 years 8 months ago
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique...
Flavia Bonomo, Maria Chudnovsky, Guillermo Dur&aac...
CVPR
2009
IEEE
15 years 3 months ago
Stereo Matching with Nonparametric Smoothness Priors in Feature Space
We propose a novel formulation of stereo matching that considers each pixel as a feature vector. Under this view, matching two or more images can be cast as matching point clouds i...
Brandon M. Smith, Hailin Jin, Li Zhang
ENTCS
2008
123views more  ENTCS 2008»
13 years 8 months ago
A Chart Semantics for the Pi-Calculus
We present a graphical semantics for the pi-calculus, that is easier to visualize and better suited to expressing causality and temporal properties than conventional relational se...
Johannes Borgström, Andrew D. Gordon, Andrew ...
APLAS
2001
ACM
14 years 2 days ago
Estimating Exception-Induced Control Flow for Java
Exception analyses so far cannot provide information on the propagation of thrown exceptions, which is necessary to construct interprocedural control flow graph, visualize exceptio...
Byeong-Mo Chang, Jang-Wu Jo
DAM
2002
76views more  DAM 2002»
13 years 8 months ago
Block duplicate graphs and a hierarchy of chordal graphs
A block graph is a graph whose blocks are cliques. A block duplicate (BD) graph is a graph obtained by adding true twins (i.e., adjacent vertices with the same closed neighborhood...
Martin Charles Golumbic, Uri N. Peled