7106 search results - page 70 / 1422 » Restricted Complexity, General Complexity |
COLT
2006
Springer
13 years 11 months ago
2006
Springer
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a ...nite dimensional space. The results imply ...
EJC
2010
13 years 7 months ago
2010
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
JCO
2010
13 years 6 months ago
2010
Abstract As a generalization of de-disjunct matrices and (w,r;d)-cover-freefamilies, the notion of (s,l)e-disjunct matrices is introduced for error-correcting pooling designs over ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a general...
TIT
1998
13 years 7 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...