Sciweavers

3396 search results - page 368 / 680
» Tree representations of graphs
Sort
View
CVPR
2007
IEEE
16 years 8 months ago
Image Classification with Segmentation Graph Kernels
We propose a family of kernels between images, defined as kernels between their respective segmentation graphs. The kernels are based on soft matching of subtree-patterns of the r...
Francis Bach, Zaïd Harchaoui
GBRPR
2005
Springer
16 years 8 days ago
Coarse-to-Fine Object Recognition Using Shock Graphs
Shock graphs have emerged as a powerful generic 2-D shape representation. However, most approaches typically assume that the silhouette has been correctly segmented. In this paper,...
Aurelie Bataille, Sven J. Dickinson
ESOP
2004
Springer
16 years 4 days ago
Canonical Graph Shapes
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
Arend Rensink
IPPS
1998
IEEE
15 years 11 months ago
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot
COMBINATORICS
2007
118views more  COMBINATORICS 2007»
15 years 6 months ago
On the Quantum Chromatic Number of a Graph
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
Peter J. Cameron, Ashley Montanaro, Michael W. New...