4488 search results - page 76 / 898 » Properties of NP-Complete Sets |
AHSWN
2008
13 years 8 months ago
2008
Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new i...
DELTA
2008
IEEE
13 years 9 months ago
2008
IEEE
This paper presents a technique that limits the maximum number of specified bits of any pattern in a given test set. The outlined method uses algorithms similar to ATPG, but explo...
CVPR
2000
IEEE
14 years 10 months ago
2000
IEEE
In this paper, we address the problem of curve and surface reconstruction from sets of points. We introduce regular interpolants which are polygonal approximations of planar curve...
CSL
2004
Springer
14 years 1 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
ARSCOM
2008
13 years 8 months ago
2008
A Greedy Defining Set is a set of entries in a Latin square with the property that when the square is systematically filled in with a greedy algorithm, the greedy algorithm succee...