Sciweavers

310 search results - page 7 / 62
» Cutting two graphs simultaneously
Sort
View
ICPR
2008
IEEE
14 years 10 months ago
Automatic bi-layer video segmentation based on sensor fusion
We propose a new solution to the problem of bilayer video segmentation in terms of both, hardware design and algorithmic solution. At the data acquisition stage, we combine color ...
Pierre Boulanger, Qiong Wu, Walter F. Bischof
ICPR
2008
IEEE
14 years 3 months ago
An approach for video cut detection using bipartite graph matching as dissimilarity distance
The video segmentation problem consists in the identification of the boundary between consecutive shots. When two consecutive frames are similar, they are considered to be in the...
Silvio Jamil Ferzoli Guimarães, Zenilton Kl...
GD
2007
Springer
14 years 3 months ago
Simultaneous Geometric Graph Embeddings
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be pla...
Alejandro Estrella-Balderrama, Elisabeth Gassner, ...
SIROCCO
2008
13 years 10 months ago
Self-stabilizing Cuts in Synchronous Networks
Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called selfstabilizing if it reaches a stable global state ...
Thomas Sauerwald, Dirk Sudholt
GD
2004
Springer
14 years 2 months ago
An Interactive Multi-user System for Simultaneous Graph Drawing
Abstract. In this paper we consider the problem of simultaneous drawing of two graphs. The goal is to produce aesthetically pleasing drawings for the two graphs by means of a heuri...
Stephen G. Kobourov, Chandan Pitta