94 search results - page 11 / 19 » A note on linear function approximation using random project... |
109
click to vote
COLING
2000
15 years 3 months ago
2000
This paper introduces a scheme, which we call the baseline method, to define a measure of term representativeness and measures defined by using the scheme. The representativeness ...
133
Voted
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
175
Voted
ESA
2010
Springer
15 years 2 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
115
click to vote
ICA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
119
click to vote
ICML
2000
IEEE
16 years 2 months ago
2000
IEEE
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...