860 search results - page 31 / 172 » Lower Bounds on the Size of Test Data Sets |
SSD
2001
Springer
14 years 3 days ago
2001
Springer
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
COLT
2001
Springer
14 years 5 days ago
2001
Springer
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...
AUSAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Bias variance decomposition for classifiers is a useful tool in understanding classifier behavior. Unfortunately, the literature does not provide consistent guidelines on...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...