2612 search results - page 220 / 523 » Assemblies as Graph Processes |
161
click to vote
ICMCS
2006
IEEE
16 years 18 days ago
2006
IEEE
This paper presents a robust and efficient skeleton-based graph matching method for object recognition and recovery applications. The novel feature is to unify both object recogni...
177
click to vote
GD
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
199
click to vote
PPSWR
2005
Springer
16 years 1 days ago
2005
Springer
Metadata processing is recognized as a central challenge for database research in the next decade. Already, novel desktop data management and search applications (cf. Apple’s Spo...
180
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
183
click to vote
AIPS
2000
15 years 8 months ago
2000
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...