2233 search results - page 265 / 447 » On the Complexity of Theory Curbing |
200
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
197
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
183
click to vote
SOFSEM
1999
Springer
15 years 10 months ago
1999
Springer
We study learning scenarios in which multiple learners are involved and “nature” imposes some constraints that force the predictions of these learners to behave coherently. Thi...
191
click to vote
ESA
1998
Springer
15 years 10 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
141
click to vote
DCC
1996
IEEE
15 years 10 months ago
1996
IEEE
The block processing inherent in the use of traditional vector quantization (VQ) schemes typically gives rise to perceptually distracting blocking artifacts. We demonstrate that s...