1952 search results - page 85 / 391 » Complete partitions of graphs |
131
click to vote
ICCS
2007
Springer
15 years 8 months ago
2007
Springer
We propose in this paper an extension of Conceptual Graphs that allows to use datatypes (strings, numbers, ...) for typing concept nodes. Though the model-theoretic semantics of th...
109
click to vote
DM
2008
15 years 4 months ago
2008
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n 3k - 2 then m k(n - k), and for n 3k - 1 an equality is possible if, and only if, G is t...
132
click to vote
KR
2000
Springer
15 years 7 months ago
2000
Springer
We investigate the problem of reasoning with partitions of related logical axioms. Our motivation is two-fold. First, we are concerned with how to reason effectively with multiple...
119
click to vote
HPDC
1994
IEEE
15 years 8 months ago
1994
IEEE
Partitioning data parallel computations across a network of heterogeneous workstations is a dificult problem for the user: We have developed a runtime partitioning methodfor choos...
165
click to vote
CVPR
2001
IEEE
16 years 6 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...