20197 search results - page 125 / 4040 » Comparing Computational Power |
145
click to vote
GI
2010
Springer
15 years 4 months ago
2010
Springer
: A recurring manual task in data integration or ontology alignment is finding mappings between complex schemas. In order to reduce the manual effort, many matching algorithms for ...
162
click to vote
ARGMAS
2005
Springer
15 years 12 months ago
2005
Springer
Systems of argumentation or ’computational dialectic’ are emerging as a powerful means of structuring inter-agent communication in multi-agent systems. Individual systems of co...
158
click to vote
SIBGRAPI
2008
IEEE
16 years 22 days ago
2008
IEEE
This paper presents a comparative study of color descriptors for content-based image retrieval on the Web. Several image descriptors were compared theoretically and the most relev...
167
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
198
click to vote
GC
2002
Springer
15 years 6 months ago
2002
Springer
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...