Sciweavers

1206 search results - page 54 / 242
» Arc-Flags in Dynamic Graphs
Sort
View
ICPR
2010
IEEE
14 years 2 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...
ICML
2003
IEEE
14 years 10 months ago
Marginalized Kernels Between Labeled Graphs
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
Hisashi Kashima, Koji Tsuda, Akihiro Inokuchi
COCOON
2009
Springer
14 years 4 months ago
Computing Bond Types in Molecule Graphs
In this paper, we deal with restoring missing information in molecule databases: Some data formats only store the atoms’ configuration but omit bond multiplicities. As this info...
Sebastian Böcker, Quang Bao Anh Bui, Patrick ...
ICML
2008
IEEE
14 years 10 months ago
Graph kernels between point clouds
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...
Francis R. Bach
DATE
2009
IEEE
209views Hardware» more  DATE 2009»
14 years 4 months ago
A graph grammar based approach to automated multi-objective analog circuit design
— This paper introduces a graph grammar based approach to automated topology synthesis of analog circuits. A grammar is developed to generate circuits through production rules, t...
Angan Das, Ranga Vemuri