23 search results - page 5 / 5 » colt 2000 |
COLT
2000
Springer
13 years 9 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
COLT
2000
Springer
13 years 9 months ago
2000
Springer
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
ECCC
2000
13 years 4 months ago
2000
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...