860 search results - page 14 / 172 » Lower Bounds on the Size of Test Data Sets |
ITC
2002
IEEE
14 years 16 days ago
2002
IEEE
Efficient production testing is frequently hampered because current digital circuits require test sets which are too large. These test sets can be reduced significantly by means...
COMPGEOM
2010
ACM
14 years 21 days ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
DATAMINE
2006
13 years 7 months ago
2006
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
ICCAD
2000
IEEE
14 years 1 days ago
2000
IEEE
For data dominated applications, the system level design trajectory should first focus on finding a good data transfer and storage solution. Since no realization details are avail...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...