860 search results - page 6 / 172 » Lower Bounds on the Size of Test Data Sets |
IPL
2010
13 years 6 months ago
2010
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
IPL
2011
12 years 11 months ago
2011
Ellul, Krawetz, Shallit and Wang prove an exponential lower bound on the size of any context-free grammar generating the language of all permutations over some alphabet. We genera...
PODS
2007
ACM
14 years 7 months ago
2007
ACM
This paper gives an overview of recent work on machine models for processing massive amounts of data. The main focus is on generalizations of the classical data stream model where...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper proves ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
RSFDGRC
2009
Springer
14 years 2 months ago
2009
Springer
A new clustering strategy is proposed based on interval sets, which is an alternative formulation different from the ones used in the existing studies. Instead of using a single s...