Sciweavers

398 search results - page 46 / 80
» Ant Algorithm for the Graph Matching Problem
Sort
View
ECCV
2008
Springer
14 years 9 months ago
Improving Shape Retrieval by Learning Graph Transduction
Abstract. Shape retrieval/matching is a very important topic in computer vision. The recent progress in this domain has been mostly driven by designing smart features for providing...
Xingwei Yang, Xiang Bai, Longin Jan Latecki, Zhuow...
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
14 years 8 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
ICCV
2011
IEEE
12 years 7 months ago
A Graph-matching Kernel for Object Categorization
This paper addresses the problem of category-level image classification. The underlying image model is a graph whose nodes correspond to a dense set of regions, and edges reflec...
Olivier Duchenne, Armand Joulin, Jean Ponce
TCS
2008
13 years 7 months ago
Approximation algorithms for partially covering with edges
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
Ojas Parekh
COCOON
1999
Springer
13 years 12 months ago
On Routing in Circulant Graphs
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerur...