Sciweavers

353 search results - page 30 / 71
» From graph states to two-graph states
Sort
View
RTA
2007
Springer
14 years 2 months ago
Adjunction for Garbage Collection with Application to Graph Rewriting
We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...
Dominique Duval, Rachid Echahed, Fréd&eacut...
TPDS
2008
96views more  TPDS 2008»
13 years 7 months ago
Stochastic Graph Processes for Performance Evaluation of Content Delivery Applications in Overlay Networks
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack
CVPR
2009
IEEE
15 years 3 months ago
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
This paper studies a framework for matching an unknown number of corresponding structures in two images (shapes), motivated by detecting objects in cluttered background and lear...
Kun Zeng, Liang Lin, Song Chun Zhu, Xiaobai Liu
TSE
2010
151views more  TSE 2010»
13 years 6 months ago
The Probabilistic Program Dependence Graph and Its Application to Fault Diagnosis
This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
George K. Baah, Andy Podgurski, Mary Jean Harrold
CVPR
2009
IEEE
14 years 2 months ago
Trajectory parsing by cluster sampling in spatio-temporal graph
The objective of this paper is to parse object trajectories in surveillance video against occlusion, interruption, and background clutter. We present a spatio-temporal graph (ST-G...
Xiaobai Liu, Liang Lin, Song Chun Zhu, Hai Jin