2317 search results - page 221 / 464 » classification 2008 |
135
click to vote
SIAMJO
2000
15 years 5 months ago
2000
We consider the gradient method xt+1 = xt + t(st + wt), where st is a descent direction of a function f : n and wt is a deterministic or stochastic error. We assume that f is Lip...
144
click to vote
SIAMJO
2002
15 years 5 months ago
2002
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
131
Voted
ACL
2008
15 years 7 months ago
2008
The omnipresence of unknown words is a problem that any NLP component needs to address in some form. While there exist many established techniques for dealing with unknown words i...
163
click to vote
NIPS
2008
15 years 7 months ago
2008
This paper presents the first Rademacher complexity-based error bounds for noni.i.d. settings, a generalization of similar existing bounds derived for the i.i.d. case. Our bounds ...
141
click to vote
FFA
2008
15 years 5 months ago
2008
We consider metric results for the asymptotic behavior of the number of solutions of Diophantine approximation inequalities with restricted denominators for Laurent formal power s...