Sciweavers

343 search results - page 25 / 69
» On Making Directed Graphs Transitive
Sort
View
126
Voted
ENTCS
2008
123views more  ENTCS 2008»
15 years 1 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 ...
90
Voted
ICASSP
2010
IEEE
15 years 2 months ago
A survey of implementation efforts and experimental design for cooperative communications
Design and analysis of cooperative communication schemes based upon modeling and simulation exist in large quantities in the research literature. Despite this fact, there have bee...
Glenn Bradford, J. Nicholas Laneman
102
Voted
GG
2004
Springer
15 years 7 months ago
Model Checking Graph Transformations: A Comparison of Two Approaches
Model checking is increasingly popular for hardware and, more recently, software verification. In this paper we describe two different approaches to extend the benefits of model ...
Arend Rensink, Ákos Schmidt, Dániel ...
PAMI
2010
260views more  PAMI 2010»
15 years 9 days ago
Unsupervised Object Segmentation with a Hybrid Graph Model (HGM)
—In this work, we address the problem of performing class-specific unsupervised object segmentation, i.e., automatic segmentation without annotated training images. Object segmen...
Guangcan Liu, Zhouchen Lin, Yong Yu, Xiaoou Tang
CMOT
2004
141views more  CMOT 2004»
15 years 1 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander