52 search results - page 2 / 11 » Representable Disjoint NP-Pairs |
EKAW
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Dealing with heterogeneous ontologies by means of semantic mappings has become an important area of research and a number of systems for discovering mappings between onto...
DM
2000
13 years 5 months ago
2000
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...
ECCV
1998
Springer
14 years 7 months ago
1998
Springer
We describe a new projectively invariant representation of disjoint contour groups which is suitable for shape-based retrieval from an image database. It consists of simultaneous ...
FSTTCS
2004
Springer
13 years 11 months ago
2004
Springer
DATE
1998
IEEE
13 years 9 months ago
1998
IEEE
Simple disjunctive decomposition is a special case of logic function decompositions, where variables are divided into two disjoint sets and there is only one newly introduced vari...