860 search results - page 116 / 172 » Lower Bounds on the Size of Test Data Sets |
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
CIKM
2011
Springer
12 years 7 months ago
2011
Springer
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
STOC
2010
ACM
14 years 15 hour ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
COMPGEOM
2007
ACM
13 years 12 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...