2063 search results - page 29 / 413 » connection 2007 |
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
IFSA
2007
Springer
15 years 4 months ago
2007
Springer
In [1, 2] we studied various concepts of bipolar queries (cf. Dubois and Prade [3]). We advocated there the use of a fuzzified version of the original crisp definition introduced...
34
Voted
SEMWEB
2007
Springer
15 years 4 months ago
2007
Springer
We are interested in replacing human processing of web resources by automated processing. Based on an experimental system we identify uncertainty issues which make this process dif...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
We show that the space of polygonizations of a fixed planar point set S of n points is connected by O(n2 ) “moves” between simple polygons. Each move is composed of a sequence...
EJC
2007
14 years 10 months ago
2007
The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalence, all non-trivial 3-separations of a 3-connected matroid. The purpose of this ...