9842 search results - page 1624 / 1969 » The Complexity of the Matching-Cut Problem |
188
click to vote
AAIM
2008
Springer
16 years 1 months ago
2008
Springer
For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with co...
183
click to vote
ACIVS
2008
Springer
16 years 1 months ago
2008
Springer
Spatial region (image) segmentation is a fundamental step for many computer vision applications. Although many methods have been proposed, less work has been done in developing sui...
199
click to vote
ADC
2008
Springer
16 years 1 months ago
2008
Springer
In this paper, we study the problem of measuring structural similarities of large number of source schemas against a single domain schema, which is useful for enhancing the qualit...
134
click to vote
ARITH
2007
IEEE
16 years 1 months ago
2007
IEEE
One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approxim...
157
click to vote
BDIM
2007
IEEE
16 years 1 months ago
2007
IEEE
The assessment and mitigation of risks related to the availability of the IT infrastructure is becoming increasingly important in modern organizations. Unfortunately, present stan...