Sciweavers

650 search results - page 18 / 130
» Positive graphs
Sort
View
CAIP
2009
Springer
210views Image Analysis» more  CAIP 2009»
15 years 1 months ago
Shape Classification Using a Flexible Graph Kernel
The medial axis being an homotopic transformation, the skeleton of a 2D shape corresponds to a planar graph having one face for each hole of the shape and one node for each junctio...
François-Xavier Dupé, Luc Brun
71
Voted
DM
2006
71views more  DM 2006»
14 years 9 months ago
Pair lengths of product graphs
The pair length of a graph G is the maximum positive integer k, such that the vertex set of G can be partitioned into disjoint pairs {x, x }, such that d(x, x ) k for every x V (...
Demetres Christofides
ENDM
2002
107views more  ENDM 2002»
14 years 9 months ago
Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...
Tao Jiang, Douglas B. West
WIRN
2005
Springer
15 years 3 months ago
Recursive Neural Networks and Graphs: Dealing with Cycles
Recursive neural networks are a powerful tool for processing structured data. According to the recursive learning paradigm, the input information consists of directed positional ac...
Monica Bianchini, Marco Gori, Lorenzo Sarti, Franc...
KR
2004
Springer
15 years 3 months ago
Improving the Forward Chaining Algorithm for Conceptual Graphs Rules
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
Jean-François Baget