Sciweavers

3204 search results - page 208 / 641
» The b-chromatic Number of a Graph
Sort
View
ICPR
2010
IEEE
14 years 3 months ago
Learning an Efficient and Robust Graph Matching Procedure for Specific Object Recognition
We present a fast and robust graph matching approach for 2D specific object recognition in images. From a small number of training images, a model graph of the object to learn is a...
Jerome Revaud, Guillaume Lavoue, Yasuo Ariki, Atil...
ICANNGA
2007
Springer
129views Algorithms» more  ICANNGA 2007»
14 years 2 months ago
Multi-class Support Vector Machines Based on Arranged Decision Graphs and Particle Swarm Optimization for Model Selection
Abstract. The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with...
Javier Acevedo, Saturnino Maldonado-Bascón,...
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
14 years 21 days ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer
UAI
2008
14 years 5 days ago
Clique Matrices for Statistical Graph Decomposition and Parameterising Restricted Positive Definite Matrices
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to d...
David Barber
CCCG
2004
14 years 4 days ago
Three-dimensional 1-bend graph drawings
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum vo...
Pat Morin, David R. Wood