Sciweavers

1327 search results - page 128 / 266
» Path following algorithm for the graph matching problem
Sort
View
136
Voted
ATMOS
2010
308views Optimization» more  ATMOS 2010»
15 years 2 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
133
Voted
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 4 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...
IROS
2008
IEEE
151views Robotics» more  IROS 2008»
15 years 10 months ago
Transition-based RRT for path planning in continuous cost spaces
This paper presents a new method called Transition-based RRT (T-RRT) for path planning problems in continuous cost spaces. It combines the exploration strength of the RRT algorith...
Leonard Jaillet, Juan Cortés, Thierry Sim&e...
DOCENG
2006
ACM
15 years 10 months ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda
ICCV
2011
IEEE
14 years 4 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