Sciweavers

286 search results - page 6 / 58
» Recognition Algorithm for Diamond-Free Graphs
Sort
View
ICPR
2008
IEEE
14 years 5 months ago
Model-based visual self-localization using geometry and graphs
In this paper, a geometric approach for global selflocalization based on a world-model and active stereo vision is introduced. The method uses class specific object recognition a...
David Israel Gonzalez-Aguirre, Tamim Asfour, Eduar...
SIAMDM
2008
105views more  SIAMDM 2008»
13 years 9 months ago
A Simple Linear Time LexBFS Cograph Recognition Algorithm
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for v...
Anna Bretscher, Derek G. Corneil, Michel Habib, Ch...
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
14 years 5 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul
ACIVS
2009
Springer
14 years 5 months ago
Attributed Graph Matching Using Local Descriptions
Abstract. In the pattern recognition context, objects can be represented as graphs with attributed nodes and edges involving their relations. Consequently, matching attributed grap...
Salim Jouili, Ines Mili, Salvatore Tabbone
GBRPR
2005
Springer
14 years 4 months ago
Reactive Tabu Search for Measuring Graph Similarity
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...
Sébastien Sorlin, Christine Solnon