Sciweavers

112 search results - page 21 / 23
» An edge colouring of multigraphs
Sort
View
ECIR
1998
Springer
13 years 11 months ago
Content Based Annotation and Retrieval in RAIDER
A new system, RAIDER (Retrieval and Annotation of Image Databases), has been developed for the management of image databases. RAIDER was designed to combat the inadequacies and in...
Stephanie R. Fountain, Tieniu Tan
DM
2008
72views more  DM 2008»
13 years 10 months ago
(p, 1)-Total labelling of graphs
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
Frédéric Havet, Min-Li Yu
PR
2002
81views more  PR 2002»
13 years 9 months ago
Generalised correlation for multi-feature correspondence
Computing correspondences between pairs of images is fundamental to all structures from motion algorithms. Correlation is a popular method to estimate similarity between patches o...
C. V. Jawahar, P. J. Narayanan
BMVC
2010
13 years 7 months ago
Classifying Textile Designs using Region Graphs
Markov random field pixel labelling is often used to obtain image segmentations in which each segment or region is labelled according to its attributes such as colour or texture. ...
Wei Jia, Stephen J. McKenna, Annette A. Ward, Keit...
GD
2005
Springer
14 years 3 months ago
Graph Treewidth and Geometric Thickness Parameters
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
Vida Dujmovic, David R. Wood