3096 search results - page 223 / 620 » The Generalized FITC Approximation |
190
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
161
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
129
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
To accelerate the learning of reinforcement learning, many types of function approximation are used to represent state value. However function approximation reduces the accuracy o...
152
click to vote
RECOMB
2003
Springer
16 years 6 months ago
2003
Springer
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
191
click to vote
FOCS
2008
IEEE
16 years 12 days ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...