860 search results - page 17 / 172 » Lower Bounds on the Size of Test Data Sets |
DM
2002
13 years 7 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
COCOA
2010
Springer
13 years 5 months ago
2010
Springer
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...
ECCC
2010
13 years 5 months ago
2010
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
COMBINATORICS
2006
13 years 7 months ago
2006
A set of vertices S is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of a graph is the size of a sma...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...