275 search results - page 43 / 55 » Parameterized Complexity of Generalized Vertex Cover Problem... |
147
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...
163
click to vote
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
168
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
151
click to vote
IPMU
1992
Springer
15 years 8 months ago
1992
Springer
This paper deals with the problem of inference under uncertain information. This is a generalization of a paper of Cardona et al. (1991a) where rules were not allowed to contain n...
154
click to vote
EJC
2008
15 years 4 months ago
2008
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...