2095 search results - page 234 / 419 » Improved pebbling bounds |
140
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
Recent theoretical results have shown that improved bounds on generalization error of classifiers can be obtained by explicitly taking the observed margin distribution of the trai...
153
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
162
click to vote
DCC
2009
IEEE
16 years 7 months ago
2009
IEEE
This paper considers the problem of transmitting the difference of two positively correlated Gaussian sources over a two-user additive Gaussian noise multiple access channel (MAC)...
155
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
173
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...