860 search results - page 1 / 172 » Lower Bounds on the Size of Test Data Sets |
AUSAI
1998
Springer
13 years 9 months ago
1998
Springer
PODS
2006
ACM
14 years 5 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
TAPAS
2011
13 years 8 days ago
2011
We study upper and lower bounds on the kernel size for the 3-hitting set problem on hypergraphs of degree at most 3, denoted 33-hs. We first show that, unless P=NP, 3-3-hs on 3-un...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
STACS
2009
Springer
13 years 10 months ago
2009
Springer
ABSTRACT. This paper gives a brief overview of computation models for data stream processing, and it introduces a new model for multi-pass processing of multiple streams, the so-ca...