860 search results - page 22 / 172 » Lower Bounds on the Size of Test Data Sets |
STOC
1992
ACM
13 years 11 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
JCO
2008
13 years 7 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
IJCAI
2003
13 years 9 months ago
2003
Often the most expensive and time-consuming task in building a pattern recognition system is col lecting and accurately labeling training and testing data. In this paper, we exp...
SIROCCO
2007
13 years 9 months ago
2007
A set of input vectors S is conclusive if correct functionality for all input vectors is implied by correct functionality over vectors in S. We consider four functionalities of co...
COMBINATORICS
2007
13 years 7 months ago
2007
In this paper, we prove that in a multigraph whose density Γ exceeds the maximum vertex degree ∆, the collection of minimal clusters (maximally dense sets of vertices) is cycle...