860 search results - page 69 / 172 » Lower Bounds on the Size of Test Data Sets |
EDM
2008
13 years 9 months ago
2008
In this paper we describe an educational data mining (EDM) case study based on the data collected during the online assessment of students who were able to immediately receive tail...
ESA
2010
Springer
13 years 9 months ago
2010
Springer
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. In this paper, we consider the problem of predicate encryption and focus on the predicate for testing whether the hamming distance between the attribute X of a data item ...
TCC
2012
Springer
12 years 3 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
DATE
2003
IEEE
14 years 1 months ago
2003
IEEE
Test pattern decompression techniques are bounded with the algorithm of test pattern ordering and test data flow controlling. Some of the methods could have more sophisticated sor...