Sciweavers

112 search results - page 17 / 23
» An edge colouring of multigraphs
Sort
View
FOCS
2004
IEEE
14 years 1 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau
IVC
2007
89views more  IVC 2007»
13 years 9 months ago
Sequential Monte Carlo tracking by fusing multiple cues in video sequences
This paper presents visual cues for object tracking in video sequences using particle filtering. A consistent histogram-based framework is developed for the analysis of colour, e...
Paul Brasnett, Lyudmila Mihaylova, David R. Bull, ...
GD
2004
Springer
14 years 3 months ago
Layouts of Graph Subdivisions
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
Vida Dujmovic, David R. Wood
CVPR
2000
IEEE
14 years 11 months ago
Statistical cues for Domain Specific Image Segmentation with Performance Analysis
This paper investigates the use of colour and texture cues for segmentation of images within two specified domains. The first is the Sowerby dataset, which contains one hundred co...
Scott Konishi, Alan L. Yuille
ICIAP
2001
Springer
14 years 10 months ago
Multivalued Image Segmentation Based on First Fundamental Form
In this paper, a new segmentation technique for multivalued images is elaborated. The technique makes use of the first fundamental form to access edge information of a multivalued...
Paul Scheunders