Sciweavers

45 search results - page 8 / 9
» Connectedness of the graph of vertex-colourings
Sort
View
DIAGRAMS
2004
Springer
14 years 24 days ago
Drawing Graphs in Euler Diagrams
We describe a method for drawing graph-enhanced Euler diagrams using a three stage method. The first stage is to lay out the underlying Euler diagram using a multicriteria optimizi...
Paul Mutton, Peter Rodgers, Jean Flower
FMCAD
2006
Springer
13 years 11 months ago
Liveness and Boundedness of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) have proven to be suitable for specifying and analyzing streaming applications that run on single- or multi-processor platforms. Streaming appl...
Amir Hossein Ghamarian, Marc Geilen, Twan Basten, ...
CVPR
2012
IEEE
11 years 9 months ago
Video segmentation by tracing discontinuities in a trajectory embedding
Our goal is to segment a video sequence into moving objects and the world scene. In recent work, spectral embedding of point trajectories based on 2D motion cues accumulated from ...
Katerina Fragkiadaki, Geng Zhang, Jianbo Shi
AAAI
2007
13 years 9 months ago
Macroscopic Models of Clique Tree Growth for Bayesian Networks
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
Ole J. Mengshoel
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
13 years 7 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka