10054 search results - page 219 / 2011 » On the Complexity of Function Learning |
138
click to vote
JMLR
2012
13 years 5 months ago
2012
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
104
click to vote
GI
2005
Springer
15 years 8 months ago
2005
Springer
: Rapid evolution of modern Information Systems and Process-Aware Information Systems (PAIS) in particular requires transactional execution of business logic. The paper introduces ...
124
click to vote
FOCS
1998
IEEE
15 years 7 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
159
click to vote
FSTTCS
1992
Springer
15 years 7 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
104
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical one-way mode...