221 search results - page 37 / 45 » Graph matching with type constraints on nodes and edges |
PODC
2005
ACM
14 years 1 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
CVPR
2012
IEEE
12 years 3 months ago
2012
IEEE
This paper introduces new types of square-piece jigsaw puzzles: those for which the orientation of each jigsaw piece is unknown. We propose a tree-based reassembly that greedily me...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
EMSOFT
2011
Springer
12 years 7 months ago
2011
Springer
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper addresses the design of a control law for vision-based robot navigation. The method proposed is based on a topological representation of the environment. Within this...