76 search results - page 5 / 16 » Lower bounds for adaptive linearity tests |
NIPS
2007
13 years 9 months ago
2007
Empirical risk minimization offers well-known learning guarantees when training and test data come from the same domain. In the real world, though, we often wish to adapt a classi...
HEURISTICS
2002
13 years 7 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
DM
2008
13 years 7 months ago
2008
Motivated from an application to DNA library screening, Balding and Torney [1] and Colbourn [4] studied the following group testing for consecutive positives. Suppose Vn = {v1 v2 ...
TIP
2008
13 years 7 months ago
2008
Abstract--Local learning methods, such as local linear regression and nearest neighbor classifiers, base estimates on nearby training samples, neighbors. Usually, the number of nei...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...